On scheduling an unbounded batch machine
From MaRDI portal
Publication:1870002
DOI10.1016/S0167-6377(02)00186-4zbMath1013.90065OpenAlexW2073593053MaRDI QIDQ1870002
Zhaohui Liu, Jinjiang Yuan, Cheng, T. C. Edwin
Publication date: 4 May 2003
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-6377(02)00186-4
Related Items (24)
Scheduling a single machine with parallel batching to minimize makespan and total rejection cost ⋮ The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan ⋮ Bicriteria scheduling on an unbounded parallel-batch machine for minimizing makespan and maximum cost ⋮ Parallel-batch scheduling with rejection: structural properties and approximation algorithms ⋮ Single machine unbounded parallel-batch scheduling with forbidden intervals ⋮ A note on special optimal batching structures to minimize total weighted completion time ⋮ Batch machine production with perishability time windows and limited batch size ⋮ On the complexity of bi-criteria scheduling on a single batch processing machine ⋮ Bi-criteria scheduling on a single parallel-batch machine ⋮ Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan ⋮ Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection ⋮ The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan ⋮ Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times ⋮ Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan ⋮ Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness ⋮ Unbounded parallel batch scheduling with job delivery to minimize makespan ⋮ Unbounded parallel-batch scheduling with drop-line tasks ⋮ Scheduling jobs with agreeable processing times and due dates on a single batch processing machine ⋮ THE NP-HARDNESS OF MINIMIZING THE TOTAL LATE WORK ON AN UNBOUNDED BATCH MACHINE ⋮ Scheduling jobs with release dates on parallel batch processing machines ⋮ Scheduling an unbounded batching machine with job processing time compatibilities ⋮ Unbounded parallel-batch scheduling under agreeable release and processing to minimize total weighted number of tardy jobs ⋮ Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine ⋮ Min–Max Scheduling of Batch or Drop-Line Jobs Under Agreeable Release and Processing Times
Cites Work
- Unnamed Item
- Scheduling a batching machine
- Scheduling with agreeable release times and due dates on a batch processing machine
- Batching identical jobs
- Scheduling one batch processor subject to job release dates
- Complexity results for single-machine problems with positive finish-start time-lags
- Scheduling with batching: A review
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
This page was built for publication: On scheduling an unbounded batch machine
