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-8zbMATH Open1067.90051MaRDI QIDQ1876151FDOQ1876151
Aifeng Yang, Jinjiang Yuan, T. C. Edwin Cheng
Publication date: 16 August 2004
Published in: European Journal of Operational Research (Search for Journal in Brave)
Recommendations
- A note on the single machine serial batching scheduling problem to minimize maximum lateness with precedence constraints
- On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times.
- Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times
- Bounded serial-batching scheduling for minimizing maximum lateness and makespan
- Bicriteria scheduling of minimizing maximum lateness and makespan on a serial-batching machine
Cites Work
- Title not available (Why is that?)
- Scheduling Groups of Jobs on a Single Machine
- The complexity of one-machine batching problems
- Batching identical jobs
- Title not available (Why is that?)
- Batch sizing and job sequencing on a single machine
- 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
Cited In (10)
- The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost
- A note on the single machine serial batching scheduling problem to minimize maximum lateness with precedence constraints
- Scheduling jobs on a single serial-batching machine with dynamic job arrivals and multiple job types
- Forming and scheduling jobs with capacitated containers in semiconductor manufacturing: Single machine problem
- A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints
- On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times.
- A survey of scheduling problems with setup times or costs
- 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
- Title not available (Why is that?)
This page was built for publication: A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1876151)
