Single machine batch scheduling with jointly compressible setup and processing times.
From MaRDI portal
Publication:1417506
DOI10.1016/S0377-2217(02)00732-4zbMath1137.90512OpenAlexW1998703883MaRDI QIDQ1417506
Mikhail Y. Kovalyov, C. T. Daniel Ng, Cheng, T. C. Edwin
Publication date: 5 January 2004
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00732-4
Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35)
Related Items
Single machine batch scheduling to minimize total completion time and resource consumption costs ⋮ A survey of scheduling with controllable processing times ⋮ Single machine scheduling problems with controllable processing times and total absolute differences penalties ⋮ Schedule execution for two-machine flow-shop with interval processing times ⋮ Minimizing maximum tardiness on a single machine with family setup times and machine disruption ⋮ Single batch machine scheduling with dual setup times for autoclave molding manufacturing ⋮ Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times ⋮ A survey of scheduling problems with setup times or costs ⋮ Single machine scheduling with common due date and controllable processing times ⋮ Single machine common flow allowance scheduling with controllable processing times
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Batch sizing and job sequencing on a single machine
- Time-optimal control in a single machine problem with resource constraints
- A bicriterion approach to time/cost trade-offs in sequencing
- Single machine scheduling subject to deadlines and resource dependent processing times
- The complexity of one-machine batching problems
- Single machine scheduling with discretely controllable processing times
- Single machine batch scheduling with deadlines and resource dependent processing times
- Scheduling with batching: A review
- Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
- Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
- Scheduling to minimize the total compression and late costs
- Bicriterion Single Machine Scheduling with Resource Dependent Processing Times
- Scheduling to minimize release-time resource consumption and tardiness penalties
- Scheduling Groups of Jobs on a Single Machine
- Single machine batch scheduling with resource dependent setup and processing times