IDEAS home Printed from https://ideas.repec.org/a/spr/jsched/v24y2021i6d10.1007_s10951-021-00708-4.html
   My bibliography  Save this article

Theoretical and practical issues in single-machine scheduling with two job release and delivery times

Author

Listed:
  • Alejandro Reynoso

    (Centro de Investigación en Ciencias, UAEMor)

  • Nodari Vakhania

    (Centro de Investigación en Ciencias, UAEMor)

Abstract

We study a single-machine scheduling problem with two allowable job release and delivery times. This special case of a strongly NP-hard single-machine scheduling problem with an arbitrary number of job release and delivery times and with the objective to minimize the maximum job completion time remains NP-hard. Nevertheless, it is more transparent and accessible than the general version. Hence, it permitted us to establish some nice properties that yielded simple and efficient solution methods. On the one hand, the restricted setting is useful by its own right since it fits some real-life applications. On the other hand, the presented case study is helpful in the solution of a more general setting with a constant number of job release and delivery times. In particular, the optimality conditions and the heuristics methods that we propose here for the restricted setting might be generalized to the extended setting. The established optimality criteria are explicit conditions under which the restricted problem can be solved optimally in time $$O(n\log n)$$ O ( n log n ) . The extensive computational study showed that at least one of these conditions is satisfied for practically all the randomly generated 50 million problem instances while applying our heuristics to these instances. We report a favorable practical performance of our polynomial-time subroutine that invokes our five heuristics and verifies the proposed optimality conditions consecutively. These conditions were verified for the solutions delivered by the five heuristics individually and in a combined fashion as four pairs of heuristics and as all the five heuristics together. Fifty million problem instances were randomly generated using uniform distribution for each of these ten combinations. For the 50 million instances generated for the last (overall) combination, the schedule created by at least one of the heuristics has satisfied at least one of our optimality conditions (so all these problem instances were solved optimally). We also addressed the (theoretical) possibility that none of our conditions is satisfied, and showed how a known dynamic programming algorithm for SUBSET SUM problem can be used for the solution of the scheduling problem in pseudo-polynomial time. For a considerable part of the tested instances, one of the five scheduling heuristics has solved optimally also SUBSET SUM problem.

Suggested Citation

  • Alejandro Reynoso & Nodari Vakhania, 2021. "Theoretical and practical issues in single-machine scheduling with two job release and delivery times," Journal of Scheduling, Springer, vol. 24(6), pages 615-647, December.
    • Handle: RePEc:spr:jsched:v:24:y:2021:i:6:d:10.1007_s10951-021-00708-4
    DOI: 10.1007/s10951-021-00708-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-021-00708-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10951-021-00708-4?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Paul Bratley & Michael Florian & Pierre Robillard, 1973. "On sequencing with earliest starts and due dates with application to computing bounds for the (n/m/G/Fmax) problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 20(1), pages 57-67, March.
    2. Nowicki, Eugeniusz, 1994. "An approximation algorithm for a single-machine scheduling problem with release times, delivery times and controllable processing times," European Journal of Operational Research, Elsevier, vol. 72(1), pages 74-81, January.
    3. C. N. Potts, 1980. "Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times," Operations Research, INFORMS, vol. 28(6), pages 1436-1441, December.
    4. Leslie A. Hall & David B. Shmoys, 1992. "Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better," Mathematics of Operations Research, INFORMS, vol. 17(1), pages 22-35, February.
    5. Nodari Vakhania, 2004. "Single-Machine Scheduling with Release Times and Tails," Annals of Operations Research, Springer, vol. 129(1), pages 253-271, July.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Federico Alonso-Pecina & José Alberto Hernández & José Maria Sigarreta & Nodari Vakhania, 2020. "Fast Approximation for Scheduling One Machine," Mathematics, MDPI, vol. 8(9), pages 1-18, September.
    2. Philip Kaminsky, 2003. "The effectiveness of the longest delivery time rule for the flow shop delivery time problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(3), pages 257-272, April.
    3. Ji Tian & Yan Zhou & Ruyan Fu, 2020. "An improved semi-online algorithm for scheduling on a single machine with unexpected breakdown," Journal of Combinatorial Optimization, Springer, vol. 40(1), pages 170-180, July.
    4. Chang, Yung-Chia & Lee, Chung-Yee, 2004. "Machine scheduling with job delivery coordination," European Journal of Operational Research, Elsevier, vol. 158(2), pages 470-487, October.
    5. Imed Kacem, 2009. "Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval," Journal of Combinatorial Optimization, Springer, vol. 17(2), pages 117-133, February.
    6. Guruprasad Pundoor & Zhi‐Long Chen, 2005. "Scheduling a production–distribution system to optimize the tradeoff between delivery tardiness and distribution cost," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(6), pages 571-589, September.
    7. Peihai Liu & Xiwen Lu, 2015. "Online scheduling on two parallel machines with release dates and delivery times," Journal of Combinatorial Optimization, Springer, vol. 30(2), pages 347-359, August.
    8. Lixin Tang & Feng Li & Jiyin Liu, 2015. "Integrated scheduling of loading and transportation with tractors and semitrailers separated," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(5), pages 416-433, August.
    9. Liang-Liang Fu & Mohamed Ali Aloulou & Christian Artigues, 2018. "Integrated production and outbound distribution scheduling problems with job release dates and deadlines," Journal of Scheduling, Springer, vol. 21(4), pages 443-460, August.
    10. Li, Chung-Lun & Vairaktarakis, George & Lee, Chung-Yee, 2005. "Machine scheduling with deliveries to multiple customer locations," European Journal of Operational Research, Elsevier, vol. 164(1), pages 39-51, July.
    11. Zhi-Long Chen, 2010. "Integrated Production and Outbound Distribution Scheduling: Review and Extensions," Operations Research, INFORMS, vol. 58(1), pages 130-148, February.
    12. Zhi-Long Chen & Guruprasad Pundoor, 2006. "Order Assignment and Scheduling in a Supply Chain," Operations Research, INFORMS, vol. 54(3), pages 555-572, June.
    13. Yinling Wang & Yan Lan & Xin Chen & Xin Han & Yong Piao, 2022. "A tight approximation algorithm for problem $$P2\rightarrow D|v=1,c=1|C_{\max }$$ P 2 → D | v = 1 , c = 1 | C max," Journal of Combinatorial Optimization, Springer, vol. 44(4), pages 2195-2206, November.
    14. Sun Lee, Ik & Yoon, S.H., 2010. "Coordinated scheduling of production and delivery stages with stage-dependent inventory holding costs," Omega, Elsevier, vol. 38(6), pages 509-521, December.
    15. Schmidt, Gunter, 2000. "Performance guarantee of two simple priority rules for production scheduling," International Journal of Production Economics, Elsevier, vol. 68(2), pages 151-159, November.
    16. Zhi-Long Chen & George L. Vairaktarakis, 2005. "Integrated Scheduling of Production and Distribution Operations," Management Science, INFORMS, vol. 51(4), pages 614-628, April.
    17. Yinling Wang & Yan Lan & Xin Chen & Xin Han & Yong Piao, 0. "A tight approximation algorithm for problem $$P2\rightarrow D|v=1,c=1|C_{\max }$$P2→D|v=1,c=1|Cmax," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-12.
    18. Ullrich, Christian A., 2013. "Integrated machine scheduling and vehicle routing with time windows," European Journal of Operational Research, Elsevier, vol. 227(1), pages 152-165.
    19. Reha Uzsoy & Chung‐Yee Lee & Louis A. Martin‐Vega, 1992. "Scheduling semiconductor test operations: Minimizing maximum lateness and number of tardy jobs on a single machine," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(3), pages 369-388, April.
    20. Nodari Vakhania, 2019. "Dynamic Restructuring Framework for Scheduling with Release Times and Due-Dates," Mathematics, MDPI, vol. 7(11), pages 1-42, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jsched:v:24:y:2021:i:6:d:10.1007_s10951-021-00708-4. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.