Single machine hierarchical scheduling with customer orders and multiple job classes

DOI10.1023/A:1018913902852zbMath0888.90091OpenAlexW107096148MaRDI QIDQ1374425

Jack A. A. van der Veen, Johnny C. Ho, Jatinder N. D. Gupta

Publication date: 28 January 1998

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1018913902852

zbMATH Keywords

makespanpolynomial time algorithmshierarchical schedulingsingle machine bi-criteria scheduling

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items

Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures ⋮ Scheduling parallel machines for the customer order problem ⋮ A learning-based two-stage optimization method for customer order scheduling ⋮ Scheduling the production of two-component jobs on a single machine ⋮ Minimizing customer order lead-time in a two-stage assembly supply chain ⋮ Preemptive multiprocessor order scheduling to minimize total weighted flowtime ⋮ Multicriteria scheduling problems: a survey ⋮ The complexity of customer order scheduling problems on parallel machines ⋮ A time-dependent multiple criteria single-machine scheduling problem ⋮ Bicriteria hierarchical optimization of two-machine flow shop scheduling problem with time-dependent deteriorating jobs ⋮ Two simulated annealing-based heuristics for the job shop scheduling problem