IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v216y2012i3p521-532.html
   My bibliography  Save this article

The just-in-time scheduling problem in a flow-shop scheduling system

Author

Listed:
  • Shabtay, Dvir

Abstract

We study the problem of maximizing the weighted number of just-in-time (JIT) jobs in a flow-shop scheduling system under four different scenarios. The first scenario is where the flow-shop includes only two machines and all the jobs have the same gain for being completed JIT. For this scenario, we provide an O(n3) time optimization algorithm which is faster than the best known algorithm in the literature. The second scenario is where the job processing times are machine-independent. For this scenario, the scheduling system is commonly referred to as a proportionate flow-shop. We show that in this case, the problem of maximizing the weighted number of JIT jobs is NP-hard in the ordinary sense for any arbitrary number of machines. Moreover, we provide a fully polynomial time approximation scheme (FPTAS) for its solution and a polynomial time algorithm to solve the special case for which all the jobs have the same gain for being completed JIT. The third scenario is where a set of identical jobs is to be produced for different customers. For this scenario, we provide an O(n3) time optimization algorithm which is independent of the number of machines. We also show that the time complexity can be reduced to O(nlogn) if all the jobs have the same gain for being completed JIT. In the last scenario, we study the JIT scheduling problem on m machines with a no-wait restriction and provide an O(mn2) time optimization algorithm.

Suggested Citation

  • Shabtay, Dvir, 2012. "The just-in-time scheduling problem in a flow-shop scheduling system," European Journal of Operational Research, Elsevier, vol. 216(3), pages 521-532.
  • Handle: RePEc:eee:ejores:v:216:y:2012:i:3:p:521-532
    DOI: 10.1016/j.ejor.2011.07.053
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221711006850
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2011.07.053?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. Mosheiov, Gur & Oron, Daniel, 2008. "Open-shop batch scheduling with identical jobs," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1282-1292, June.
    2. G Mosheiov, 2003. "Scheduling unit processing time jobs on an m-machine flow-shop," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(4), pages 437-441, April.
    3. Kovalyov, Mikhail Y. & Ng, C.T. & Cheng, T.C. Edwin, 2007. "Fixed interval scheduling: Models, applications, computational complexity and algorithms," European Journal of Operational Research, Elsevier, vol. 178(2), pages 331-342, April.
    4. Mosheiov, Gur & Oron, Daniel, 2005. "A note on flow-shop and job-shop batch scheduling with identical processing-time jobs," European Journal of Operational Research, Elsevier, vol. 161(1), pages 285-291, February.
    5. Mosheiov, Gur & Shadmon, Michal, 2001. "Minmax earliness-tardiness costs with unit processing time jobs," European Journal of Operational Research, Elsevier, vol. 130(3), pages 638-652, May.
    6. Choi, Byung-Cheon & Yoon, Suk-Hun & Chung, Sung-Jin, 2007. "Minimizing maximum completion time in a proportionate flow shop with one machine of different speed," European Journal of Operational Research, Elsevier, vol. 176(2), pages 964-974, January.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Imen Hamdi & Imen Boujneh, 2022. "Particle swarm optimization based-algorithms to solve the two-machine cross-docking flow shop problem: just in time scheduling," Journal of Combinatorial Optimization, Springer, vol. 44(2), pages 947-969, September.
    2. Shabtay, Dvir & Gilenson, Miri, 2023. "A state-of-the-art survey on multi-scenario scheduling," European Journal of Operational Research, Elsevier, vol. 310(1), pages 3-23.
    3. Danny Hermelin & Dvir Shabtay & Nimrod Talmon, 2019. "On the parameterized tractability of the just-in-time flow-shop scheduling problem," Journal of Scheduling, Springer, vol. 22(6), pages 663-676, December.
    4. Janiak, Adam & Janiak, Władysław A. & Krysiak, Tomasz & Kwiatkowski, Tomasz, 2015. "A survey on scheduling problems with due windows," European Journal of Operational Research, Elsevier, vol. 242(2), pages 347-357.
    5. Koulamas, Christos, 2020. "The proportionate flow shop total tardiness problem," European Journal of Operational Research, Elsevier, vol. 284(2), pages 439-444.
    6. Yunqiang Yin & T. C. E. Cheng & Du-Juan Wang & Chin-Chia Wu, 2017. "Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs," Journal of Scheduling, Springer, vol. 20(4), pages 313-335, August.
    7. Enrique Gerstl & Gur Mosheiov, 2023. "A note: maximizing the weighted number of Just-in-Time jobs for a given job sequence," Journal of Scheduling, Springer, vol. 26(4), pages 403-409, August.
    8. Yin, Yunqiang & Cheng, Shuenn-Ren & Cheng, T.C.E. & Wang, Du-Juan & Wu, Chin-Chia, 2016. "Just-in-time scheduling with two competing agents on unrelated parallel machines," Omega, Elsevier, vol. 63(C), pages 41-47.

    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. Liji Shen & Jatinder N. D. Gupta, 2018. "Family scheduling with batch availability in flow shops to minimize makespan," Journal of Scheduling, Springer, vol. 21(2), pages 235-249, April.
    2. Shen, Liji & Buscher, Udo, 2012. "Solving the serial batching problem in job shop manufacturing systems," European Journal of Operational Research, Elsevier, vol. 221(1), pages 14-26.
    3. S.S. Panwalkar & Christos Koulamas, 2015. "Proportionate flow shop: New complexity results and models with due date assignment," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(2), pages 98-106, March.
    4. Slotnick, Susan A., 2011. "Order acceptance and scheduling: A taxonomy and review," European Journal of Operational Research, Elsevier, vol. 212(1), pages 1-11, July.
    5. Lee, Soonhui & Turner, Jonathan & Daskin, Mark S. & Homem-de-Mello, Tito & Smilowitz, Karen, 2012. "Improving fleet utilization for carriers by interval scheduling," European Journal of Operational Research, Elsevier, vol. 218(1), pages 261-269.
    6. Gur Mosheiov & Daniel Oron, 2023. "A note on batch scheduling on a two-machine flowshop with machine-dependent processing times," 4OR, Springer, vol. 21(3), pages 457-469, September.
    7. Omri Dover & Dvir Shabtay, 2016. "Single machine scheduling with two competing agents, arbitrary release dates and unit processing times," Annals of Operations Research, Springer, vol. 238(1), pages 145-178, March.
    8. Akiyoshi Shioura & Natalia V. Shakhlevich & Vitaly A. Strusevich & Bernhard Primas, 2018. "Models and algorithms for energy-efficient scheduling with immediate start of jobs," Journal of Scheduling, Springer, vol. 21(5), pages 505-516, October.
    9. Gur Mosheiov & Daniel Oron, 2011. "Batch scheduling on a two‐machine jobshop with machine‐dependent setup times," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(7), pages 676-684, October.
    10. Zhao, Chuan-Li & Tang, Heng-Yong, 2010. "Scheduling deteriorating jobs under disruption," International Journal of Production Economics, Elsevier, vol. 125(2), pages 294-299, June.
    11. Di Martinelly, Christine & Meskens, Nadine, 2017. "A bi-objective integrated approach to building surgical teams and nurse schedule rosters to maximise surgical team affinities and minimise nurses' idle time," International Journal of Production Economics, Elsevier, vol. 191(C), pages 323-334.
    12. Danny Hermelin & Dvir Shabtay & Nimrod Talmon, 2019. "On the parameterized tractability of the just-in-time flow-shop scheduling problem," Journal of Scheduling, Springer, vol. 22(6), pages 663-676, December.
    13. Wenjie Li & Jinjiang Yuan, 2015. "An Improved Online Algorithm for the Online Preemptive Scheduling of Equal-Length Intervals on a Single Machine with Lookahead," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 32(06), pages 1-9, December.
    14. Türsel Eliiyi, Deniz & Azizoglu, Meral, 2011. "Heuristics for operational fixed job scheduling problems with working and spread time constraints," International Journal of Production Economics, Elsevier, vol. 132(1), pages 107-121, July.
    15. Yim, Seho & Hong, Sung-Pil & Park, Myoung-Ju & Chung, Yerim, 2022. "Inverse interval scheduling via reduction on a single machine," European Journal of Operational Research, Elsevier, vol. 303(2), pages 541-549.
    16. Chung, Dae-Young & Choi, Byung-Cheon, 2013. "Outsourcing and scheduling for two-machine ordered flow shop scheduling problems," European Journal of Operational Research, Elsevier, vol. 226(1), pages 46-52.
    17. G Mosheiov, 2003. "Scheduling unit processing time jobs on an m-machine flow-shop," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(4), pages 437-441, April.
    18. Eliiyi, Deniz Türsel & Ornek, Arslan & Karakütük, SadIk Serhat, 2009. "A vehicle scheduling problem with fixed trips and time limitations," International Journal of Production Economics, Elsevier, vol. 117(1), pages 150-161, January.
    19. Allahverdi, Ali & Ng, C.T. & Cheng, T.C.E. & Kovalyov, Mikhail Y., 2008. "A survey of scheduling problems with setup times or costs," European Journal of Operational Research, Elsevier, vol. 187(3), pages 985-1032, June.
    20. Rossit, Daniel A. & Vásquez, Óscar C. & Tohmé, Fernando & Frutos, Mariano & Safe, Martín D., 2021. "A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems," European Journal of Operational Research, Elsevier, vol. 289(3), pages 841-854.

    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:eee:ejores:v:216:y:2012:i:3:p:521-532. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.