Sequencing Under Precedence Constraints

Vitaly A. Strusevich () and Kabir Rustogi
Additional contact information
Vitaly A. Strusevich: University of Greenwich
Kabir Rustogi: University of Greenwich

Chapter Chapter 3 in Scheduling with Time-Changing Effects and Rate-Modifying Activities, 2017, pp 37-55 from Springer

Abstract: Abstract In this chapter, we review scheduling problems on a single machine, provided that precedence constraints are imposed on the set of jobs, so that not all permutations of jobs are feasible.

Keywords: Schedule Problem; Completion Time; Single Machine; Precedence Constraint; Transitive Closure (search for similar items in EconPapers)
Date: 2017
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:isochp:978-3-319-39574-6_3

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

DOI: 10.1007/978-3-319-39574-6_3

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().