On scheduling an unbounded batch machine
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 6402512
- Scheduling an Unbounded Batch Machine to Minimize Maximum Lateness
- Scheduling an unbounded batching machine with job processing time compatibilities
- Scheduling problems on parallel identical unbounded batch processing machines
- Bounded parallel-batch scheduling on unrelated parallel machines
- Unbounded batch scheduling with a common due window on a single machine
- A note on unbounded parallel-batch scheduling
- The unbounded parallel batch machine scheduling with rejection
- Single machine unbounded parallel-batch scheduling with forbidden intervals
- An unbounded batch scheduling with rejections
Cites work
- Batching identical jobs
- Complexity results for single-machine problems with positive finish-start time-lags
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- scientific article; zbMATH DE number 44978 (Why is no real title available?)
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
- Scheduling a batching machine
- Scheduling one batch processor subject to job release dates
- Scheduling with agreeable release times and due dates on a batch processing machine
- Scheduling with batching: A review
Cited in
(28)- Unbounded parallel batch scheduling with job delivery to minimize makespan
- Scheduling jobs with agreeable processing times and due dates on a single batch processing machine
- Scheduling jobs with release dates on parallel batch processing machines
- Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection
- Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan
- Unbounded parallel-batch scheduling with drop-line tasks
- Unbounded parallel-batch scheduling under agreeable release and processing to minimize total weighted number of tardy jobs
- Busy time scheduling on a bounded number of machines (extended abstract)
- Single machine unbounded parallel-batch scheduling with forbidden intervals
- A note on special optimal batching structures to minimize total weighted completion time
- Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan
- Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness
- Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine
- Integrated scheduling problem on a single bounded batch machine with an unavailability constraint
- Scheduling a single machine with parallel batching to minimize makespan and total rejection cost
- Bicriteria scheduling on an unbounded parallel-batch machine for minimizing makespan and maximum cost
- THE NP-HARDNESS OF MINIMIZING THE TOTAL LATE WORK ON AN UNBOUNDED BATCH MACHINE
- Scheduling an Unbounded Batch Machine to Minimize Maximum Lateness
- Bi-criteria scheduling on a single parallel-batch machine
- Min-max scheduling of batch or drop-line jobs under agreeable release and processing times
- The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan
- Parallel-batch scheduling with rejection: structural properties and approximation algorithms
- Batch machine production with perishability time windows and limited batch size
- On the complexity of bi-criteria scheduling on a single batch processing machine
- Unbounded parallel-batch scheduling to minimize the total weighted tardy span
- Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times
- Scheduling an unbounded batching machine with job processing time compatibilities
- The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
This page was built for publication: On scheduling an unbounded batch machine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1870002)
