Forthcoming and Online First Articles

International Journal of Planning and Scheduling

International Journal of Planning and Scheduling (IJPS)

Forthcoming articles have been peer-reviewed and accepted for publication but are pending final changes, are not yet published and may not appear here in their final order of publication until they are assigned to issues. Therefore, the content conforms to our standards but the presentation (e.g. typesetting and proof-reading) is not necessarily up to the Inderscience standard. Additionally, titles, authors, abstracts and keywords may change before publication. Articles will not be published until the final proofs are validated by their authors.

Forthcoming articles must be purchased for the purposes of research, teaching and private study only. These articles can be cited using the expression "in press". For example: Smith, J. (in press). Article Title. Journal Title.

Articles marked with this shopping trolley icon are available for purchase - click on the icon to send an email request to purchase.

Online First articles are published online here, before they appear in a journal issue. Online First articles are fully citeable, complete with a DOI. They can be cited, read, and downloaded. Online First articles are published as Open Access (OA) articles to make the latest research available as early as possible.

Open AccessArticles marked with this Open Access icon are Online First articles. They are freely available and openly accessible to all without any restriction except the ones stated in their respective CC licenses.

Register for our alerting service, which notifies you by email when new issues are published online.

We also offer which provide timely updates of tables of contents, newly published articles and calls for papers.

International Journal of Planning and Scheduling (1 paper in press)

Regular Issues

  • Integrated Production and Shipping Scheduling for a Single Manufacturer and Multiple Customers   Order a copy of this article
    by Fangzhou Sun, Subhash C. Sarin, Yuqiang Wang, Akshat Kothyari 
    Abstract: We investigate a supply chain scheduling problem involving a single manufacturer and multiple customers. Our aim is to integrate the production and shipping functions of a manufacturer for the objective of minimising the total cost consisting of: 1) the penalty of late deliveries computed based on the weighted number of tardy orders; 2) the shipping of orders to customers. Since this problem is NP-hard, besides an optimum-seeking algorithm, we also develop a fast heuristic both of which exploit the structural properties of the problem. The results of our computational investigation reveal the efficacy of our approaches and a significant benefit that accrues from integrating the production and distribution functions.
    Keywords: scheduling; dynamic programming; branch-and-bound; combinatorial optimisation.
    DOI: 10.1504/IJPS.2023.10063419
     

 

Return to top