General Purpose Procedures for Deterministic Scheduling

Michael L. Pinedo
Additional contact information
Michael L. Pinedo: NYU Stern School of Business, IOMS Dept Rm 8-59 KMC

Chapter Chapter 14 in Scheduling, 2016, pp 375-398 from Springer

Abstract: Abstract This chapter describes a number of general purpose procedures that are useful in dealing with scheduling problems in practice and that can be implemented with relative ease in industrial scheduling systems. All the techniques described are heuristics that do not guarantee an optimal solution; they instead aim at finding reasonably good solutions in a relatively short time. The heuristics tend to be fairly generic and can be adapted easily to a large variety of scheduling problems.

Keywords: Schedule Problem; Simulated Annealing; Critical Path; Local Search Procedure; Total Weighted Tardiness (search for similar items in EconPapers)
Date: 2016
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-319-26580-3_14

Ordering information: This item can be ordered from
http://www.springer.com/9783319265803

DOI: 10.1007/978-3-319-26580-3_14

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().