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

DOI10.1016/J.EJOR.2014.12.002MaRDI QIDQ319136zbMATHOpenAlexFDO

Authors Arne Mensendiek, Jatinder N. D. Gupta, 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

metaheuristicsassignment problemsschedulingbranch and boundfixed delivery dates

Mathematics Subject Classification ID

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

Recommendations

• Scheduling identical parallel machines with a fixed number of delivery dates
• Scheduling on parallel identical machines to minimize total tardiness
• Scheduling parallel machines to minimize total weighted and unweighted tardiness
• Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time
• Scheduling identical parallel machines to minimize total weighted completion time
• Scheduling jobs with sizes and delivery times on identical parallel batch machines
• Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs
• Due-date assignment and early/tardy scheduling on identical parallel machines
• Scheduling on uniform parallel machines to minimize maximum lateness

Cites work

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

Cited in

(11)

• Scheduling with Fixed Delivery Dates
• Scheduling parallel-machine batch operations to maximize on-time delivery performance
• Integrated production and transportation scheduling with order-dependent inventory holding costs
• Finding efficient make-to-order production and batch delivery schedules
• Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness
• Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints
• Integrated production and outbound distribution scheduling problems with job release dates and deadlines
• Heuristic algorithm for lot sizing and scheduling on identical parallel machines
• Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints
• New exact and approximation algorithms for integrated production and transportation scheduling with committed delivery due dates and order acceptance
• Scheduling identical parallel machines with a fixed number of delivery dates

This page was built for publication: Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q319136)