Scheduling multi-operation jobs on a single machine
From MaRDI portal
Publication:1960312
DOI10.1023/A:1018959420252zbMath0931.90014MaRDI QIDQ1960312
Thomas Tautenhahn, A. E. Gerodimos, Chris N. Potts, Celia A. Dr. Glass
Publication date: 11 January 2000
Published in: Annals of Operations Research (Search for Journal in Brave)
complexitysingle machinedynamic programming algorithmmaximum latenessweighted number of late jobssum of job completion timesscheduling multi-operation jobs
Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)
Related Items
One-operator, two-machine open shop and flow shop problems with setup times for machines and weighted number of tardy jobs objective ⋮ Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures ⋮ The single machine batching problem with identical family setup times to minimize maximum lateness is strongly NP-hard ⋮ Customer order scheduling on a single machine with family setup times: complexity and algorithms ⋮ Scheduling with batching: A review ⋮ Scheduling the production of two-component jobs on a single machine ⋮ Single-machine scheduling of multi-operation jobs without missing operations to minimize the total completion time ⋮ Approximating Weighted Completion Time for Order Scheduling with Setup Times ⋮ Scheduling for fabrication and assembly in a two-machine flowshop with a fixed job sequence ⋮ A survey of scheduling problems with setup times or costs ⋮ Preemptive multiprocessor order scheduling to minimize total weighted flowtime ⋮ Single-machine batch scheduling to minimize the total setup cost in the presence of deadlines ⋮ Strong NP-hardness of the single machine multi-operation jobs total completion time scheduling problem. ⋮ Iterated greedy algorithms for a complex parallel machine scheduling problem
