Skip to main content
SpringerLink
Log in

Schedule Generation Schemes for the Job-Shop Problem with Sequence-Dependent Setup Times: Dominance Properties and Computational Analysis

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

We consider the job-shop problem with sequence-dependent setup times. We focus on the formal definition of schedule generation schemes (SGSs) based on the semi-active, active, and non-delay schedule categories. We study dominance properties of the sets of schedules obtainable with each SGS. We show how the proposed SGSs can be used within single-pass and multi-pass priority rule based heuristics. We study several priority rules for the problem and provide a comparative computational analysis of the different SGSs on sets of instances taken from the literature. The proposed SGSs significantly improve previously best-known results on a set of hard benchmark instances.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Adams, J., E. Balas, and D. Zawack. (1988). “The Shifting Bottleneck Procedure for Jobshop Scheduling.” Management Science 34, 391–401.

    Google Scholar 

  • Allahverdi, A., J.N.D. Gupta, and T. Aldowaisan. (1999). “A Review of Scheduling Research Involving Setup Considerations.” Omega 27, 219–239.

    Article  Google Scholar 

  • Artigues, C. and F. Roubellat. (2002). “An Efficient Algorithm for Operation Insertion in Practical Jobshop Schedules.” Production Planning and Control 13(2), 175–186.

    Article  Google Scholar 

  • Baker, K.R. (1974). Introduction to Sequencing and Scheduling. Wiley.

  • Brucker, P. and O. Thiele. (1996). “A Branch and Bound Method for the General-Shop Problem with Sequence-Dependent Setup Times.” Operations Research Spektrum 18, 145–161.

    Article  Google Scholar 

  • Carlier, J. and E. Néron. (2000). “An Exact Method for Solving the Multi-Processor Flow-Shop.” RAIRO Operations Research 34(1), 1–25.

    Article  Google Scholar 

  • Focacci, F., P. Laborie, and W. Nuijten. (2000). “Solving Scheduling Problems With Setup Times and Alternative Resources.” In Fifth International Conference on Artificial Intelligence Planning and Scheduling Breckenbridge, Colorado, pp. 92–101.

  • Giffler, B. and G.L. Thompson. (1960). “Algorithms for Solving Production Scheduling Problems.” Operations Research 8(4), 487–503.

    Article  Google Scholar 

  • Gupta, S.K. (1986). “N Jobs and m Machines Job-Shop Problems with Sequence-Dependent Set-up Times.” International Journal of Production Research 20(5), 643–656.

    Google Scholar 

  • Hurink, J. and S. Knust. (2001). “List Scheduling in a Parallel Machine Environment with Precedence Constraints and Setup Times.” Operations Research Letters 29, 231–239.

    Article  Google Scholar 

  • Kim, S.C. and P.M. Bobrowski. (1994). “Impact of Sequence-Dependent Setup Time on Job Shop Scheduling Performance.” International Journal of Production Research 32(7), 1503–1520.

    Google Scholar 

  • Kolisch, R. (1995). Project Scheduling Under Resource constraints. Physica-Verlag.

  • Kolisch, R. (1996). “Serial and Parallel Resource-Constrained Project Scheduling Methods Revisited: Theory and Computation.” European Journal of Operational Research 90, 320–333.

    Article  Google Scholar 

  • Noivo, J.A. and H. Ramalhinho-Lourenço. (1998). “Solving Two Production Scheduling Problems with Sequence-Dependent Set-Up Times.” Economic Working Paper Series n. 338, Department of Economics and Business, Universitat Pompeu Fabra.

  • Ovacik, I.M. and R. Uzsoy. (1993). “Worst-Case Error Bounds for Parallel Machine Scheduling Problems with Bounded Sequence-Dependent Setup Times.” Operations Research Letters 14, 251–256.

    Article  Google Scholar 

  • Ovacik, I.M. and R. Uzsoy. (1994). “Exploiting Shop Floor Status Information to Schedule Complex Job Shops.” Journal of Manufacturing Systems 13, 73–84.

    Google Scholar 

  • Schutten, J.M.J. (1996). “List Scheduling Revisited.” Operations Research Letters 18, 167–170.

    Article  Google Scholar 

  • Schutten, J.M.J. (1998). “Practical Job Shop Scheduling.” Annals of Operations Research 83, 161–178.

    Article  Google Scholar 

  • Sotskov, Y.N., T. Tautenhahn, and F. Werner. (1999). “On the Application of Insertion Techniques for Job Shop Problems with Setup Times.” RAIRO Operations Research 33(2), 209–245.

    Article  Google Scholar 

  • Sprecher, A., R. Kolisch, and A. Drexl. (1995). “Semi-Active, Active, and Non-Delay Schedules for the Resource-Constrained Project Scheduling Problem.” European Journal of Operational Research 80, 94–102.

    Article  Google Scholar 

  • Yang, W.-H. and C.-J. Liao. (1999). “Survey of Scheduling Research Involving Setup Times.” International Journal of Systems Science 30(2), 143–155.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d'Informatique d'Avignon, FRE CNRS 2487, BP 1228, 84911, Avignon, France

    Christian Artigues

  2. LAAS - CNRS, 7 avenue du Colonel Roche, 31077, Toulouse, France

    Pierre Lopez

  3. Laboratoire d'Informatique d'Avignon, FRE CNRS 2487, BP 1228, 84911, Avignon, France

    Pierre-Dimitri Ayache

Authors
  1. Christian Artigues
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pierre Lopez
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Pierre-Dimitri Ayache
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Christian Artigues.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Artigues, C., Lopez, P. & Ayache, PD. Schedule Generation Schemes for the Job-Shop Problem with Sequence-Dependent Setup Times: Dominance Properties and Computational Analysis. Ann Oper Res 138, 21–52 (2005). https://doi.org/10.1007/s10479-005-2443-4

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-005-2443-4

Keywords

Search

Navigation