Scheduling with batch setup times and earliness-tardiness penalties
From MaRDI portal
Publication:1278527
DOI10.1016/S0377-2217(96)00096-3zbMath0917.90188OpenAlexW1984048943MaRDI QIDQ1278527
Publication date: 22 February 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(96)00096-3
dynamic programmingsingle machinecommon due dateNP-hardnessbatch setup timesearliness-tardiness penalties
Related Items
A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time ⋮ Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach ⋮ Earliness and tardiness scheduling problems on a batch processor ⋮ Single machine scheduling with family setups to minimize total earliness and tardiness ⋮ Batch scheduling in a two-level supply chain -- a focus on the supplier ⋮ Earliness-tardiness scheduling with setup considerations ⋮ A Meta-RaPS for the early/tardy single machine scheduling problem ⋮ Scheduling multiple products on parallel machines with setup costs
Cites Work
- Unnamed Item
- Unnamed Item
- Survey of scheduling research involving due date determination decisions
- A single machine scheduling problem with earliness/tardiness and starting time penalties under a common due date
- Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs
- On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date
- Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobs
- Batch scheduling to minimize total completion time
- A note on one-processor scheduling with asymmetric earliness and tardiness penalties
- Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date
- Sequencing with Earliness and Tardiness Penalties: A Review
- Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date
- One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
- Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
- Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
- On the Complexity of Scheduling with Batch Setup Times
- A Better Heuristic for Preemptive Parallel Machine Scheduling with Batch Setup Times
- The parallel machine min-max weighted absolute lateness scheduling problem
- Error Bound of a Heuristic for the Common Due Date Scheduling Problem
- Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times
- Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties
- Single-machine scheduling with early and tardy completion costs
- Parallel Machine Scheduling with Batch Setup Times
