A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times
From MaRDI portal
Publication:1876151
DOI10.1016/S0377-2217(03)00361-8zbMath1067.90051MaRDI QIDQ1876151
Jinjiang Yuan, Aifeng Yang, Cheng, T. C. Edwin
Publication date: 16 August 2004
Published in: European Journal of Operational Research (Search for Journal in Brave)
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
- A note on the single machine serial batching scheduling problem to minimize maximum lateness with precedence constraints
- Lower bounds for scheduling a single robot in a job-shop environment
- Scheduling Groups of Jobs on a Single Machine
Related Items (8)
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 ⋮ Serial batch scheduling on uniform parallel machines to minimize total completion time ⋮ Exact algorithms based on a constrained shortest path model for robust serial-batch and parallel-batch scheduling problems ⋮ On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times. ⋮ Forming and scheduling jobs with capacitated containers in semiconductor manufacturing: Single machine problem ⋮ A survey of scheduling problems with setup times or costs ⋮ A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints
This page was built for publication: A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times
