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

    by Umutcan Ayasand?r, Meral Azizoglu 
    Abstract: In this study, we consider a two dimensional cutting stock problem with multiple stock sizes and two stage guillotine cuts. Our objective is to maximize the difference between total revenue earned over all cut items and total cost spent over all used panels. We propose two mathematical models, derive some optimality properties and use them to enhance the performances of the models. We develop decomposition-based heuristics that use the best of the proposed models to solve the subproblems. The results of our computational study have revealed that the models can return optimal solutions for the instances with up to 30 items in 2 hours and the heuristics produce near-optimal solutions for the instances with up to 50 items in 5 minutes.
    Keywords: Integer Programming; Heuristics; Cutting Stock Problem.
    DOI: 10.1504/IJPS.2021.10043393