On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times.

DOI10.1016/S0167-6377(03)00007-5zbMath1145.90392OpenAlexW2003450057MaRDI QIDQ1413926

D. Massart

Publication date: 17 November 2003

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(03)00007-5

zbMATH Keywords

SchedulingPrecedence constraintsBatches

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Scheduling jobs on a single serial-batching machine with dynamic job arrivals and multiple job types, The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost, The lockmaster's problem, Serial batch scheduling on uniform parallel machines to minimize total completion time, On competitive analysis for polling systems, A survey of scheduling problems with setup times or costs, Parallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deterioration

Cites Work

• Unnamed Item
• Unnamed Item
• Batch sizing and job sequencing on a single machine
• The complexity of one-machine batching problems
• Batching identical jobs
• Lower bounds for scheduling a single robot in a job-shop environment
• Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints