Scheduling problems with non-regular penalty functions - a review
From MaRDI portal
Publication:1106097
zbMath0649.90065MaRDI QIDQ1106097
Publication date: 1988
Published in: Opsearch (Search for Journal in Brave)
Deterministic scheduling theory in operations research (90B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Earliness-tardiness scheduling problems with a common delivery window ⋮ Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem ⋮ Job sequencing and due date assignment in a single machine shop with uncertain processing times ⋮ Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date ⋮ Single machine scheduling to minimize weighted earliness subject to maximum tardiness ⋮ Optimal sequences in stochastic single machine shops ⋮ Multiple and bicriteria scheduling: A literature survey ⋮ Scheduling jobs on a machine subject to stochastic breakdowns to minimize absolute early-tardy penalties ⋮ A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions ⋮ Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date ⋮ Tabu search for a class of single-machine scheduling problems ⋮ Determination of common due window location in a single machine scheduling problem ⋮ A survey of the state-of-the-art of common due date assignment and scheduling research
