scientific article; zbMATH DE number 866105
From MaRDI portal
Publication:4873242
zbMath0842.90058MaRDI QIDQ4873242
Peter Brucker, Mikhail Y. Kovalyov
Publication date: 16 April 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
due dateweighted number of late jobsfully polynomial approximation schemesingle machine batch scheduling
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)
Related Items (19)
Optimally competitive list batching ⋮ Single machine scheduling problem with batch setups involving positional deterioration effects and multiple rate-modifying activities ⋮ Scheduling unrelated parallel batch processing machines with non-identical job sizes ⋮ 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 ⋮ Two-agent scheduling with agent specific batches on an unbounded serial batching machine ⋮ No-Wait Scheduling Problems with Batching Machines ⋮ MILP models to minimise makespan in additive manufacturing machine scheduling problems ⋮ Scheduling with batching: A review ⋮ Scheduling with centralized and decentralized batching policies in concurrent open shops ⋮ On Minimizing Total Tardiness in a Serial Batching Problem ⋮ Pseudo-polynomial dynamic programming for an integrated due date assignment, resource allocation, production, and distribution scheduling model in supply chain 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 ⋮ Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries ⋮ Single machine scheduling subject to deadlines and resource dependent processing times ⋮ A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems ⋮ Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries for multiple customers in supply chains
This page was built for publication:
