A survey of the state-of-the-art of common due date assignment and scheduling research

By V. Gordon, Jean-Marie Proth, Chengbin Chu. European Journal of Operational Research, 2002

486 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Non-identical parallel-machine scheduling research with minimizing total weighted completion times: Models, relaxations and algorithms ☆ (2009, unknown): “[6], Cheng et al.”
A survey of scheduling with controllable processing times (2007, unknown): “[29,30].”
Permutation flow shop scheduling with earliness and tardiness penalties (2004, background): “Most of this literature, which is rather recent, is based on single machine environments as found in Baker and Scudder (1990), Gordon et al. (2002) and references therein.”
Order acceptance and scheduling: A taxonomy and review (2011, background): “Gupta et al. (1992) present an optimal dynamic pro gramming (DP) procedure for the unconstrained problem when a specified number of projects is to be chosen.”