A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs
From MaRDI portal
Publication:1278296
DOI10.1016/0377-2217(95)00168-9zbMath0929.90041OpenAlexW2047821474MaRDI QIDQ1278296
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/0377-2217(95)00168-9
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items (13)
Machine scheduling with job delivery coordination ⋮ 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 ⋮ Scheduling in a two-stage supply chain with uncertain parameters ⋮ A zero-inventory production and distribution problem with a fixed customer sequence ⋮ 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 ⋮ Machine scheduling with transportation considerations ⋮ Parallel-Machine Scheduling to Minimize Flowtime, Holding, and Batch Delivery Costs ⋮ 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 ⋮ A PTAS for single-machine scheduling with release dates and job delivery to minimize makespan
Cites Work
This page was built for publication: A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs
