Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs

From MaRDI portal
Publication:1268191

DOI10.1016/0377-2217(95)00133-6zbMath0916.90147OpenAlexW2043712566MaRDI QIDQ1268191

Zhi-Long Chen

Publication date: 7 March 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(95)00133-6



Related Items

Single machine scheduling with assignable due dates, Machine scheduling with job delivery coordination, Single-machine serial-batch delivery scheduling with two competing agents and due date assignment, Optimal due date assignment in multi-machine scheduling environments, Due date assignment and single machine scheduling with deteriorating jobs to minimize the weighted number of tardy jobs, Optimal restricted due date assignment in scheduling, Two due date assignment problems in scheduling a single machine, An improved approximation algorithm for single machine scheduling with job delivery, Coordinating multi-location production and customer delivery, SINGLE MACHINE SCHEDULING WITH JOB DELIVERY TO MINIMIZE MAKESPAN, Two-stage medical supply chain scheduling with an assignable common due window and shelf life, Using genetic algorithm for lot sizing and scheduling problem with arbitrary job volumes and distinct job due date considerations, 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, Multicriteria scheduling problems: a survey, Real-time due-date promising by build-to-order environments, 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 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 classification of dynamic programming formulations for offline deterministic single-machine scheduling problems, A survey of the state-of-the-art of common due date assignment and scheduling research, Common due date assignment and single-machine scheduling with release times to minimize the weighted number of tardy jobs



Cites Work