Single machine scheduling with sequence-dependent family setups to minimize maximum lateness
From MaRDI portal
Publication:3585727
DOI10.1057/jors.2009.63zbMath1193.90101OpenAlexW2052031819MaRDI QIDQ3585727
Jatinder N. D. Gupta, Cheng Wu, Feng Jin, Shi-ji Song
Publication date: 2 September 2010
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.2009.63
tabu searchsingle machineempirical resultsstructural propertiessequence-dependent family setup timesmaximum lateness or tardiness
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (6)
The third comprehensive survey on scheduling problems with setup times/costs ⋮ Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties ⋮ A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness ⋮ Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times ⋮ ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness ⋮ The single machine weighted mean squared deviation problem
This page was built for publication: Single machine scheduling with sequence-dependent family setups to minimize maximum lateness
