Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness

DOI10.1016/j.ejor.2014.12.002zbMath1346.90373OpenAlexW2029241815MaRDI QIDQ319136

Jatinder N. D. Gupta, Arne Mensendiek, Jan Herrmann

Publication date: 6 October 2016

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2014.12.002

zbMATH Keywords

schedulingmetaheuristicsassignment problemsbranch and boundfixed delivery dates

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)

Related Items

Integrated production and outbound distribution scheduling problems with job release dates and deadlines ⋮ Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints ⋮ Integrated production and transportation scheduling with order-dependent inventory holding costs ⋮ Finding efficient make-to-order production and batch delivery schedules ⋮ New exact and approximation algorithms for integrated production and transportation scheduling with committed delivery due dates and order acceptance

Cites Work

• Coordinated scheduling of production and delivery with production window and delivery capacity constraints
• Scheduling on parallel identical machines to minimize total tardiness
• Note on Shim and Kim's lower bounds for scheduling on identical parallel machines to minimize total tardiness
• Scheduling unrelated parallel machines to minimize total weighted tardiness.
• A tabu search algorithm for parallel machine total tardiness problem
• Sequencing the processing of incoming mail to match an outbound truck delivery schedule
• Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
• Single machine scheduling with delivery dates and cumulative payoffs
• Integrated production and distribution with fixed delivery departure dates
• Integrated Production and Outbound Distribution Scheduling: Review and Extensions
• Minimizing Total Tardiness on One Machine is NP-Hard
• Scheduling with Fixed Delivery Dates
• The Weighted Total Tardiness Problem with Fixed Shipping Times and Overtime Utilization
• Minimizing total tardiness in an unrelated parallel-machine scheduling problem
• A tabu search heuristic for the generalized assignment problem