Earliness and tardiness scheduling problems on a batch processor
From MaRDI portal
Publication:1961238
DOI10.1016/S0166-218X(99)00113-4zbMath0987.90042OpenAlexW2045745934MaRDI QIDQ1961238
Publication date: 17 January 2000
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00113-4
Related Items (5)
Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system ⋮ Decomposition heuristics for minimizing earliness-tardiness on parallel burn-in ovens with a common due date ⋮ Just-in-time single-batch-processing machine scheduling ⋮ Hybrid approach for a single-batch-processing machine scheduling problem with a just-in-time objective and consideration of non-identical due dates of jobs ⋮ A survey of scheduling with parallel batch (p-batch) processing
Cites Work
- Efficient scheduling algorithms for a single batch processing machine
- Single-machine scheduling with time windows and earliness/tardiness penalties
- Scheduling with batch setup times and earliness-tardiness penalties
- Scheduling with agreeable release times and due dates on a batch processing machine
- Minimizing total completion time on a batch processing machine with job families
- Sequencing with Earliness and Tardiness Penalties: A Review
- One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
- Batching and Scheduling Jobs on Batch and Discrete Processors
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Scheduling batch processing machines with incompatible job families
- Single Machine Scheduling with a Common Delivery Window
- Scheduling Groups of Jobs on a Single Machine
This page was built for publication: Earliness and tardiness scheduling problems on a batch processor
