On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date
From MaRDI portal
Publication:1310010
DOI10.1016/0377-2217(93)90239-JzbMath0842.90060OpenAlexW2079884080MaRDI QIDQ1310010
Chung-Yee Lee, Jeffrey W. Herrmann
Publication date: 6 August 1996
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(93)90239-j
common due datesingle-machine scheduling problembatch deliverypseudo-polynomial dynamic programmingsum of earliness and tardiness penalties
Related Items
Single machine scheduling with assignable due dates ⋮ Machine scheduling with job delivery coordination ⋮ Simultaneous minimization of total completion time and total deviation of job completion times ⋮ Two heuristic methods based on decomposition to the integrated multi-agent supply chain scheduling and distribution problem ⋮ Single-machine serial-batch delivery scheduling with two competing agents and due date assignment ⋮ Single-machine batch delivery scheduling with job release dates, due windows and earliness, tardiness, holding and delivery costs ⋮ An improved approximation algorithm for single machine scheduling with job delivery ⋮ Coordinating multi-location production and customer delivery ⋮ An ERNSGA‐III algorithm for the production and distribution planning problem in the multiagent supply chain ⋮ Scheduling unrelated parallel machine problem with multi-mode processing times and batch delivery cost ⋮ An improved memetic algorithm for integrated production scheduling and vehicle routing decisions ⋮ Integration of finished goods batch delivery into production scheduling via total tardiness minimization ⋮ Integrated production and delivery scheduling for multi-factory supply chain with stage-dependent inventory holding cost ⋮ SINGLE MACHINE SCHEDULING WITH JOB DELIVERY TO MINIMIZE MAKESPAN ⋮ Two-stage medical supply chain scheduling with an assignable common due window and shelf life ⋮ Single machine scheduling with release dates and job delivery to minimize the makespan ⋮ Logistics scheduling with batching and transportation ⋮ Machine scheduling with transportation considerations ⋮ Parallel-Machine Scheduling to Minimize Flowtime, Holding, and Batch Delivery Costs ⋮ Parallel machine scheduling with a common due window ⋮ Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval ⋮ Unbounded parallel batch scheduling with job delivery to minimize makespan ⋮ Batch sizing and just-in-time scheduling with common due date ⋮ Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs ⋮ A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs ⋮ Scheduling with batch setup times and earliness-tardiness penalties ⋮ A PTAS for single-machine scheduling with release dates and job delivery to minimize makespan ⋮ An approximation algorithm for a supply-chain scheduling problem with an assignable common due window and holding time ⋮ A survey of the state-of-the-art of common due date assignment and scheduling research ⋮ The coordination of scheduling and batch deliveries
Cites Work
- Unnamed Item
- Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date
- Batching to Minimize Flow Times on One Machine
- Sequencing with Earliness and Tardiness Penalties: A Review
- A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
- 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
- Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
