A note on the single machine serial batching scheduling problem to minimize maximum lateness with precedence constraints

DOI10.1016/S0167-6377(01)00105-5zbMath1030.90038OpenAlexW2076533886MaRDI QIDQ1612004

R. Smith

Publication date: 28 August 2002

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

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

zbMATH Keywords

due-dates

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times, When serial batch scheduling involves parallel batching decisions: a branch and price scheme, A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines, A survey of scheduling problems with setup times or costs, An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines, Scheduling with or without precedence relations on a serial-batch machine to minimize makespan and maximum cost, Multi-Objective Optimization and Multi-Attribute Decision Making for a Novel Batch Scheduling Problem Based on Mould Capabilities

Cites Work

• Unnamed Item
• Unnamed Item
• Batch sizing and job sequencing on a single machine
• The complexity of one-machine batching problems
• Scheduling Groups of Jobs on a Single Machine