IDEAS home Printed from https://ideas.repec.org/a/spr/jsched/v22y2019i6d10.1007_s10951-019-00607-9.html
   My bibliography  Save this article

Shop scheduling problems with pliable jobs

Author

Listed:
  • S. Knust

    (University of Osnabrück)

  • N. V. Shakhlevich

    (University of Leeds)

  • S. Waldherr

    (Technical University of Munich)

  • C. Weiß

    (Fraunhofer Institute for Industrial Mathematics ITWM)

Abstract

In this paper, we study a new type of flow shop and open shop models, which handle so-called “pliable” jobs: their total processing times are given, but individual processing times of operations which make up these jobs are flexible and need to be determined. Our analysis demonstrates that many versions of flow shop and open shop problems with pliable jobs appear to be computationally easier than their traditional counterparts, unless the jobs have job-dependent restrictions imposed on minimum and maximum operation lengths. In the latter case, most problems with pliability become NP-hard even in the case of two machines.

Suggested Citation

  • S. Knust & N. V. Shakhlevich & S. Waldherr & C. Weiß, 2019. "Shop scheduling problems with pliable jobs," Journal of Scheduling, Springer, vol. 22(6), pages 635-661, December.
    • Handle: RePEc:spr:jsched:v:22:y:2019:i:6:d:10.1007_s10951-019-00607-9
    DOI: 10.1007/s10951-019-00607-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-019-00607-9
    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-019-00607-9?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. Paolo Serafini, 1996. "Scheduling Jobs on Several Machines with the Job Splitting Property," Operations Research, INFORMS, vol. 44(4), pages 617-628, August.
    2. Robert McNaughton, 1959. "Scheduling with Deadlines and Loss Functions," Management Science, INFORMS, vol. 6(1), pages 1-12, October.
    3. McClain, John O. & Thomas, L. Joseph & Sox, Charles, 1992. ""On-the-fly" line balancing with very little WIP," International Journal of Production Economics, Elsevier, vol. 27(3), pages 283-289, October.
    4. Sartaj Sahni, 1979. "Preemptive Scheduling with Due Dates," Operations Research, INFORMS, vol. 27(5), pages 925-934, October.
    5. R L Burdett & E Kozan, 2001. "Sequencing and scheduling in flowshops with task redistribution," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 52(12), pages 1379-1389, December.
    6. Askin, Ronald G. & Chen, Jiaqiong, 2006. "Dynamic task assignment for throughput maximization with worksharing," European Journal of Operational Research, Elsevier, vol. 168(3), pages 853-869, February.
    7. E. L. Lawler & C. U. Martel, 1989. "Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs," Operations Research, INFORMS, vol. 37(2), pages 314-318, April.
    8. Dan Trietsch & Kenneth R. Baker, 1993. "Basic Techniques for Lot Streaming," Operations Research, INFORMS, vol. 41(6), pages 1065-1076, December.
    9. Matthias Bultmann & Sigrid Knust & Stefan Waldherr, 2018. "Flow shop scheduling with flexible processing times," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(3), pages 809-829, July.
    10. Jatinder Gupta & Christos Koulamas & George Kyparisis & Chris Potts & Vitaly Strusevich, 2004. "Scheduling Three-Operation Jobs in a Two-Machine Flow Shop to Minimize Makespan," Annals of Operations Research, Springer, vol. 129(1), pages 171-185, July.
    11. Koulamas, Christos & Kyparisis, George J., 2015. "The three-machine proportionate open shop and mixed shop minimum makespan problems," European Journal of Operational Research, Elsevier, vol. 243(1), pages 70-74.
    12. Egon Balas & Eitan Zemel, 1980. "An Algorithm for Large Zero-One Knapsack Problems," Operations Research, INFORMS, vol. 28(5), pages 1130-1154, October.
    13. Ruiz-Torres, Alex J. & Ho, Johnny C. & Ablanedo-Rosas, José H., 2011. "Makespan and workstation utilization minimization in a flowshop with operations flexibility," Omega, Elsevier, vol. 39(3), pages 273-282, June.
    14. N. Brauner & Y. Crama & A. Grigoriev & J. Klundert, 2005. "A Framework for the Complexity of High-Multiplicity Scheduling Problems," Journal of Combinatorial Optimization, Springer, vol. 9(3), pages 313-323, May.
    15. S. M. Johnson, 1954. "Optimal two‐ and three‐stage production schedules with setup times included," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 1(1), pages 61-68, March.
    16. M. R. Garey & D. S. Johnson & Ravi Sethi, 1976. "The Complexity of Flowshop and Jobshop Scheduling," Mathematics of Operations Research, INFORMS, vol. 1(2), pages 117-129, May.
    17. Bultmann, Matthias & Knust, Sigrid & Waldherr, Stefan, 2018. "Synchronous flow shop scheduling with pliable jobs," European Journal of Operational Research, Elsevier, vol. 270(3), pages 943-956.
    18. N. Hefetz & I. Adiri, 1982. "A note on the influence of missing operations on scheduling problems," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 29(3), pages 535-539, September.
    19. Gultekin, Hakan, 2012. "Scheduling in flowshops with flexible operations: Throughput optimization and benefits of flexibility," International Journal of Production Economics, Elsevier, vol. 140(2), pages 900-911.
    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. Ahmadian, Mohammad Mahdi & Khatami, Mostafa & Salehipour, Amir & Cheng, T.C.E., 2021. "Four decades of research on the open-shop scheduling problem to minimize the makespan," European Journal of Operational Research, Elsevier, vol. 295(2), pages 399-426.

    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. Matthias Bultmann & Sigrid Knust & Stefan Waldherr, 2018. "Flow shop scheduling with flexible processing times," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(3), pages 809-829, July.
    2. Pan, Quan-Ke & Ruiz, Rubén, 2012. "An estimation of distribution algorithm for lot-streaming flow shop problems with setup times," Omega, Elsevier, vol. 40(2), pages 166-180, April.
    3. 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.
    4. Bagchi, Tapan P. & Gupta, Jatinder N.D. & Sriskandarajah, Chelliah, 2006. "A review of TSP based approaches for flowshop scheduling," European Journal of Operational Research, Elsevier, vol. 169(3), pages 816-854, March.
    5. Lenstra, J. K. & Rinnooy Kan, A. H. G., 1980. "An Introduction To Multiprocessor Scheduling," Econometric Institute Archives 272258, Erasmus University Rotterdam.
    6. Akiyoshi Shioura & Natalia V. Shakhlevich & Vitaly A. Strusevich, 2020. "Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost," Journal of Global Optimization, Springer, vol. 76(3), pages 471-490, March.
    7. Bertrand M. T. Lin & F. J. Hwang & Jatinder N. D. Gupta, 2017. "Two-machine flowshop scheduling with three-operation jobs subject to a fixed job sequence," Journal of Scheduling, Springer, vol. 20(3), pages 293-302, June.
    8. Christoph Hertrich & Christian Weiß & Heiner Ackermann & Sandy Heydrich & Sven O. Krumke, 2020. "Scheduling a proportionate flow shop of batching machines," Journal of Scheduling, Springer, vol. 23(5), pages 575-593, October.
    9. Kameng Nip & Zhenbo Wang & Fabrice Talla Nobibon & Roel Leus, 2015. "A combination of flow shop scheduling and the shortest path problem," Journal of Combinatorial Optimization, Springer, vol. 29(1), pages 36-52, January.
    10. Zongxu Mu & Minming Li, 2015. "DVS scheduling in a line or a star network of processors," Journal of Combinatorial Optimization, Springer, vol. 29(1), pages 16-35, January.
    11. Bock, Felix & Bruhn, Henning, 2021. "Case study on scheduling cyclic conveyor belts," Omega, Elsevier, vol. 102(C).
    12. Jan Gmys, 2022. "Exactly Solving Hard Permutation Flowshop Scheduling Problems on Peta-Scale GPU-Accelerated Supercomputers," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2502-2522, September.
    13. Shioura, Akiyoshi & Shakhlevich, Natalia V. & Strusevich, Vitaly A., 2018. "Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: A review of solution approaches," European Journal of Operational Research, Elsevier, vol. 266(3), pages 795-818.
    14. Cheng, T. C. Edwin & Shakhlevich, Natalia V., 2005. "Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 165(2), pages 444-456, September.
    15. A.A. Gladky & Y.M. Shafransky & V.A. Strusevich, 2004. "Flow Shop Scheduling Problems Under Machine–Dependent Precedence Constraints," Journal of Combinatorial Optimization, Springer, vol. 8(1), pages 13-28, March.
    16. Yong Chen & Yinhui Cai & Longcheng Liu & Guangting Chen & Randy Goebel & Guohui Lin & Bing Su & An Zhang, 2022. "Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph," Journal of Combinatorial Optimization, Springer, vol. 43(3), pages 571-588, April.
    17. Hoogeveen, Han, 2005. "Multicriteria scheduling," European Journal of Operational Research, Elsevier, vol. 167(3), pages 592-623, December.
    18. Joseph Y.-T. Leung & Michael Pinedo & Guohua Wan, 2010. "Competitive Two-Agent Scheduling and Its Applications," Operations Research, INFORMS, vol. 58(2), pages 458-469, April.
    19. Wieslaw Kubiak & Yanling Feng & Guo Li & Suresh P. Sethi & Chelliah Sriskandarajah, 2020. "Efficient algorithms for flexible job shop scheduling with parallel machines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 67(4), pages 272-288, June.
    20. Stanisław Gawiejnowicz, 2020. "A review of four decades of time-dependent scheduling: main results, new topics, and open problems," Journal of Scheduling, Springer, vol. 23(1), pages 3-47, February.

    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:22:y:2019:i:6:d:10.1007_s10951-019-00607-9. 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.