Scheduling with batching: Minimizing the weighted number of tardy jobs

DOI10.1016/0167-6377(94)90063-9zbMath0820.90052OpenAlexW2014889423MaRDI QIDQ1342278

Dan Landy, Dorit S. Hochbaum

Publication date: 11 January 1995

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(94)90063-9

zbMATH Keywords

due dateNP-completenessprocessing timesemiconductor manufacturingpseudo-polynomial timeweighted tardiness with batching

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

One-operator, two-machine open shop and flow shop problems with setup times for machines and weighted number of tardy jobs objective ⋮ Minimizing total weighted tardiness on a single batch process machine with incompatible job families ⋮ A branch and bound algorithm to minimize the total weighed number of tardy jobs and delivery costs ⋮ A survey of single machine scheduling to minimize weighted number of tardy jobs ⋮ Single machine batch scheduling with deadlines and resource dependent processing times ⋮ Single machine batch scheduling with non-increasing time slot costs ⋮ Two-agent scheduling with agent specific batches on an unbounded serial batching machine ⋮ Batch machine production with perishability time windows and limited batch size ⋮ Scheduling with batching: A review ⋮ Scheduling with centralized and decentralized batching policies in concurrent open shops ⋮ Forming and scheduling jobs with capacitated containers in semiconductor manufacturing: Single machine problem ⋮ Family scheduling with batch availability in flow shops to minimize makespan ⋮ Single machine scheduling with deadlines, release and due dates ⋮ Scheduling batches with simultaneous job processing for two-machine shop problems ⋮ Pseudo-polynomial dynamic programming for an integrated due date assignment, resource allocation, production, and distribution scheduling model in supply chain scheduling ⋮ Maximization of solution flexibility for robust shop scheduling ⋮ Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains ⋮ Optimal delivery time quotation in supply chains to minimize tardiness and delivery costs ⋮ Single machine batch scheduling with resource dependent setup and processing times ⋮ Scheduling with batching: Two job types ⋮ Parallel machine batching and scheduling with deadlines ⋮ Scheduling on a batch processing machine with split compatibility graphs ⋮ Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries for multiple customers in supply chains

Cites Work

• Unnamed Item
• Batch sizing and job sequencing on a single machine
• One-pass batching algorithms for the one-machine problem
• A polynomial algorithm for a one machine batching problem
• The complexity of one-machine batching problems
• Batching to Minimize Flow Times on One Machine
• Optimal Scheduling of Products with Two Subassemblies on a Single Machine
• Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs
• A Functional Equation and its Application to Resource Allocation and Sequencing Problems