IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v35y1993i5p397-434.html
   My bibliography  Save this article

Deterministic scheduling in computing and manufacturing systems: a survey of models and algorithms

Author

Listed:
  • Tzafestas, Spyros
  • Triantafyllakis, Alekos

Abstract

Scheduling problems deal with the assignment of tasks, over time, to processors, so as to optimize a performance criterion, while satisfying a set of given constraints. In this paper a comprehensive survey of the major results in this area is presented. Specifically, a unified formulation of deterministic scheduling models (problems) is provided on the basis of the three standard data fields, viz. the task set, the processor set, and the optimality criterion set. Some particular practical interpretations of these problems are briefly outlined, and a general discussion on their solution approaches is included. The main body of the paper examines the classes of “parallel processor scheduling” and “resource constrained scheduling” problems. In both classes the following cases are considered: (i) makespan minimization, (ii) maximum lateness minimization, (iii) mean and mean weighted flow time minimization, and (iv) maximum weighted lateness minimization. The paper ends with a discussion of some problems of the sequencing, open-shop, job-shop and flow-shop types, and with some remarks on the potentiality of artificial intelligence and expert systems to solve difficult scheduling problems.

Suggested Citation

  • Tzafestas, Spyros & Triantafyllakis, Alekos, 1993. "Deterministic scheduling in computing and manufacturing systems: a survey of models and algorithms," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 35(5), pages 397-434.
    • Handle: RePEc:eee:matcom:v:35:y:1993:i:5:p:397-434
    DOI: 10.1016/0378-4754(93)90041-R
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/037847549390041R
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/0378-4754(93)90041-R?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. Slowinski, Roman, 1981. "Multiobjective network scheduling with efficient use of renewable and nonrenewable resources," European Journal of Operational Research, Elsevier, vol. 7(3), pages 265-273, July.
    2. Jon K. Wilbrecht & William B. Prescott, 1969. "The Influence of Setup Time on Job Shop Performance," Management Science, INFORMS, vol. 16(4), pages 274-280, December.
    3. David G. Dannenbring, 1977. "An Evaluation of Flow Shop Sequencing Heuristics," Management Science, INFORMS, vol. 23(11), pages 1174-1182, July.
    4. Ilya Gertsbakh & Helman I. Stern, 1978. "Minimal Resources for Fixed and Variable Job Schedules," Operations Research, INFORMS, vol. 26(1), pages 68-85, February.
    5. Sawik, Tadeusz J., 1982. "Scheduling multi-operational tasks on nonidentical machines as a time-optimal control problem," European Journal of Operational Research, Elsevier, vol. 10(2), pages 173-181, June.
    6. M. R. Garey & R. L. Graham & D. S. Johnson, 1978. "Performance Guarantees for Scheduling Algorithms," Operations Research, INFORMS, vol. 26(1), pages 3-21, February.
    7. E. L. Lawler & J. M. Moore, 1969. "A Functional Equation and its Application to Resource Allocation and Sequencing Problems," Management Science, INFORMS, vol. 16(1), pages 77-84, September.
    8. Kenneth R. Baker & Linus E. Schrage, 1978. "Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks," Operations Research, INFORMS, vol. 26(1), pages 111-120, February.
    9. Teofilo Gonzalez & Sartaj Sahni, 1978. "Flowshop and Jobshop Schedules: Complexity and Approximation," Operations Research, INFORMS, vol. 26(1), pages 36-52, February.
    10. R. D. Haynes & C. A. Komar & Jack Byrd, Jr., 1973. "The Effectiveness of Three Heuristic Rules for Job Sequencing in a Single Production Facility," Management Science, INFORMS, vol. 19(5), pages 575-580, January.
    11. E. L. Lawler & B. D. Sivazlian, 1978. "Minimization of Time-Varying Costs in Single-Machine Scheduling," Operations Research, INFORMS, vol. 26(4), pages 563-569, August.
    12. Peter Brucker & M. R. Garey & D. S. Johnson, 1977. "Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness," Mathematics of Operations Research, INFORMS, vol. 2(3), pages 275-284, August.
    13. O'Grady, E.Pearse, 1986. "Problem partitioning in parallel processor simulation systems," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 28(2), pages 141-150.
    14. C. N. Potts & L. N. Van Wassenhove, 1988. "Algorithms for Scheduling a Single Machine to Minimize the Weighted Number of Late Jobs," Management Science, INFORMS, vol. 34(7), pages 843-858, July.
    15. T. C. Hu & Y. S. Kuo & F. Ruskey, 1987. "Some Optimum Algorithms for Scheduling Problems with Changeover Costs," Operations Research, INFORMS, vol. 35(1), pages 94-99, February.
    16. Mahendra S. Bakshi & Sant Ram Arora, 1969. "The Sequencing Problem," Management Science, INFORMS, vol. 16(4), pages 247-263, December.
    17. Jeffrey B. Sidney, 1975. "Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs," Operations Research, INFORMS, vol. 23(2), pages 283-298, April.
    18. J. K. Lenstra & A. H. G. Rinnooy Kan, 1978. "Complexity of Scheduling under Precedence Constraints," Operations Research, INFORMS, vol. 26(1), pages 22-35, February.
    19. Robert McNaughton, 1959. "Scheduling with Deadlines and Loss Functions," Management Science, INFORMS, vol. 6(1), pages 1-12, October.
    20. Kanet, John J. & Adelsberger, Heimo H., 1987. "Expert systems in production scheduling," European Journal of Operational Research, Elsevier, vol. 29(1), pages 51-59, April.
    21. B. J. Lageweg & J. K. Lenstra & A. H. G. Rinnooy Kan, 1977. "Job-Shop Scheduling by Implicit Enumeration," Management Science, INFORMS, vol. 24(4), pages 441-450, December.
    22. Jean-Claude Picard & Maurice Queyranne, 1978. "The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling," Operations Research, INFORMS, vol. 26(1), pages 86-110, February.
    23. David Ronen, 1986. "Short-Term Scheduling of Vessels for Shipping Bulk or Semi-Bulk Commodities Originating in a Single Area," Operations Research, INFORMS, vol. 34(1), pages 164-173, February.
    24. Silver, Edward A. & Victor, R. & Vidal, V. & de Werra, Dominique, 1980. "A tutorial on heuristic methods," European Journal of Operational Research, Elsevier, vol. 5(3), pages 153-162, September.
    25. Ravi Sethi, 1977. "On the Complexity of Mean Flow Time Scheduling," Mathematics of Operations Research, INFORMS, vol. 2(4), pages 320-330, November.
    26. Marius M. Solomon, 1987. "Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints," Operations Research, INFORMS, vol. 35(2), pages 254-265, April.
    27. T. C. Hu, 1961. "Parallel Sequencing and Assembly Line Problems," Operations Research, INFORMS, vol. 9(6), pages 841-848, December.
    28. Zaw-Sing Su & Kenneth C. Sevcik, 1978. "A Combinatorial Approach to Dynamic Scheduling Problems," Operations Research, INFORMS, vol. 26(5), pages 836-844, October.
    29. Tapan Sen & Farhad M. E. Raiszadeh & Parthasarati Dileepan, 1988. "Note---A Branch-and-Bound Approach to the Bicriterion Scheduling Problem Involving Total Flowtime and Range of Lateness," Management Science, INFORMS, vol. 34(2), pages 254-260, February.
    30. Blazewicz, J. & Barcelo, J. & Kubiak, W. & Rock, H., 1986. "Scheduling tasks on two processors with deadlines and additional resources," European Journal of Operational Research, Elsevier, vol. 26(3), pages 364-370, September.
    31. Jeffrey B. Sidney, 1977. "Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties," Operations Research, INFORMS, vol. 25(1), pages 62-69, February.
    32. S. S. Panwalkar & Wafik Iskander, 1977. "A Survey of Scheduling Rules," Operations Research, INFORMS, vol. 25(1), pages 45-61, February.
    33. Marshall L. Fisher, 1980. "Worst-Case Analysis of Heuristic Algorithms," Management Science, INFORMS, vol. 26(1), pages 1-17, January.
    34. Clyde L. Monma, 1982. "Linear-Time Algorithms for Scheduling on Parallel Processors," Operations Research, INFORMS, vol. 30(1), pages 116-124, February.
    35. Sudarshan K. Dhall & C. L. Liu, 1978. "On a Real-Time Scheduling Problem," Operations Research, INFORMS, vol. 26(1), pages 127-140, February.
    36. W. L. Eastman & S. Even & I. M. Isaacs, 1964. "Bounds for the Optimal Scheduling of n Jobs on m Processors," Management Science, INFORMS, vol. 11(2), pages 268-279, November.
    37. William L. Berry & Vittal Rao, 1975. "Critical Ratio Scheduling: An Experimental Analysis," Management Science, INFORMS, vol. 22(2), pages 192-201, October.
    38. Robert C. Leachman & André Gascon, 1988. "A Heuristic Scheduling Policy for Multi-Item, Single-Machine Production Systems with Time-Varying, Stochastic Demands," Management Science, INFORMS, vol. 34(3), pages 377-390, March.
    39. J. Michael Moore, 1968. "An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs," Management Science, INFORMS, vol. 15(1), pages 102-109, September.
    40. Gabriel R. Bitran & Elizabeth A. Haas & Hirofumi Matsuo, 1986. "Production Planning of Style Goods with High Setup Costs and Forecast Revisions," Operations Research, INFORMS, vol. 34(2), pages 226-236, April.
    41. Sartaj Sahni, 1977. "General Techniques for Combinatorial Approximation," Operations Research, INFORMS, vol. 25(6), pages 920-936, December.
    42. A. H. G. Rinnooy Kan & B. J. Lageweg & J. K. Lenstra, 1975. "Minimizing Total Costs in One-Machine Scheduling," Operations Research, INFORMS, vol. 23(5), pages 908-927, October.
    43. Yookun Cho & Sartaj Sahni, 1981. "Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops," Operations Research, INFORMS, vol. 29(3), pages 511-522, June.
    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. Neppalli, Venkata Ranga & Chen, Chuen-Lung & Gupta, Jatinder N. D., 1996. "Genetic algorithms for the two-stage bicriteria flowshop problem," European Journal of Operational Research, Elsevier, vol. 95(2), pages 356-373, December.
    2. Lee, Sang M. & Asllani, Arben A., 2004. "Job scheduling with dual criteria and sequence-dependent setups: mathematical versus genetic programming," Omega, Elsevier, vol. 32(2), pages 145-153, April.
    3. Gupta, Jatinder N. D. & Neppalli, Venkata R. & Werner, Frank, 2001. "Minimizing total flow time in a two-machine flowshop problem with minimum makespan," International Journal of Production Economics, Elsevier, vol. 69(3), pages 323-338, February.

    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. Timkovsky, Vadim G., 2003. "Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity," European Journal of Operational Research, Elsevier, vol. 149(2), pages 355-376, September.
    2. C N Potts & V A Strusevich, 2009. "Fifty years of scheduling: a survey of milestones," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 41-68, May.
    3. D. Prot & O. Bellenguez-Morineau, 2018. "A survey on how the structure of precedence constraints may change the complexity class of scheduling problems," Journal of Scheduling, Springer, vol. 21(1), pages 3-16, February.
    4. Felix Happach, 2021. "Makespan minimization with OR-precedence constraints," Journal of Scheduling, Springer, vol. 24(3), pages 319-328, June.
    5. Blazewicz, Jacek & Domschke, Wolfgang & Pesch, Erwin, 1996. "The job shop scheduling problem: Conventional and new solution techniques," European Journal of Operational Research, Elsevier, vol. 93(1), pages 1-33, August.
    6. Jiang, Xiaojuan & Lee, Kangbok & Pinedo, Michael L., 2021. "Ideal schedules in parallel machine settings," European Journal of Operational Research, Elsevier, vol. 290(2), pages 422-434.
    7. Lenstra, J. K. & Rinnooy Kan, A. H. G., 1980. "An Introduction To Multiprocessor Scheduling," Econometric Institute Archives 272258, Erasmus University Rotterdam.
    8. Koulamas, Christos & Kyparisis, George J., 2023. "A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems," European Journal of Operational Research, Elsevier, vol. 305(3), pages 999-1017.
    9. Valls, Vicente & Angeles Perez, M. & Sacramento Quintanilla, M., 1998. "A tabu search approach to machine scheduling," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 277-300, April.
    10. Jain, A. S. & Meeran, S., 1999. "Deterministic job-shop scheduling: Past, present and future," European Journal of Operational Research, Elsevier, vol. 113(2), pages 390-434, March.
    11. Guinet, Alain & Legrand, Marie, 1998. "Reduction of job-shop problems to flow-shop problems with precedence constraints," European Journal of Operational Research, Elsevier, vol. 109(1), pages 96-110, August.
    12. Allahverdi, Ali & Gupta, Jatinder N. D. & Aldowaisan, Tariq, 1999. "A review of scheduling research involving setup considerations," Omega, Elsevier, vol. 27(2), pages 219-239, April.
    13. Bornstein, Claudio Thomas & Alcoforado, Luciane Ferreira & Maculan, Nelson, 2005. "A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem," European Journal of Operational Research, Elsevier, vol. 165(3), pages 649-656, September.
    14. Nagar, Amit & Haddock, Jorge & Heragu, Sunderesh, 1995. "Multiple and bicriteria scheduling: A literature survey," European Journal of Operational Research, Elsevier, vol. 81(1), pages 88-104, February.
    15. Hejl, Lukáš & Šůcha, Přemysl & Novák, Antonín & Hanzálek, Zdeněk, 2022. "Minimizing the weighted number of tardy jobs on a single machine: Strongly correlated instances," European Journal of Operational Research, Elsevier, vol. 298(2), pages 413-424.
    16. M'Hallah, Rym & Bulfin, R.L., 2007. "Minimizing the weighted number of tardy jobs on a single machine with release dates," European Journal of Operational Research, Elsevier, vol. 176(2), pages 727-744, January.
    17. Andreas S. Schulz & Nelson A. Uhan, 2011. "Near-Optimal Solutions and Large Integrality Gaps for Almost All Instances of Single-Machine Precedence-Constrained Scheduling," Mathematics of Operations Research, INFORMS, vol. 36(1), pages 14-23, February.
    18. Christoph Ambühl & Monaldo Mastrolilli & Nikolaus Mutsanas & Ola Svensson, 2011. "On the Approximability of Single-Machine Scheduling with Precedence Constraints," Mathematics of Operations Research, INFORMS, vol. 36(4), pages 653-669, November.
    19. Peridy, Laurent & Pinson, Eric & Rivreau, David, 2003. "Using short-term memory to minimize the weighted number of late jobs on a single machine," European Journal of Operational Research, Elsevier, vol. 148(3), pages 591-603, August.
    20. Holsenback, J. E. & Russell, R. M. & Markland, R. E. & Philipoom, P. R., 1999. "An improved heuristic for the single-machine, weighted-tardiness problem," Omega, Elsevier, vol. 27(4), pages 485-495, August.

    More about this item

    Statistics

    Access and download statistics

    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:matcom:v:35:y:1993:i:5:p:397-434. 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.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    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.