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

DOI10.1016/J.EJOR.2014.12.002zbMATH Open1346.90373OpenAlexW2029241815MaRDI QIDQ319136FDOQ319136

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

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

zbMATH Keywords

metaheuristicsassignment problemsschedulingbranch and boundfixed delivery dates

Mathematics Subject Classification ID

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

Cites Work

• Sequencing the processing of incoming mail to match an outbound truck delivery schedule
• Integrated production and distribution with fixed delivery departure dates
• Integrated Production and Outbound Distribution Scheduling: Review and Extensions
• Scheduling with Fixed Delivery Dates
• Coordinated scheduling of production and delivery with production window and delivery capacity constraints
• Minimizing Total Tardiness on One Machine is NP-Hard
• 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
• Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
• Single machine scheduling with delivery dates and cumulative payoffs
• 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
• Scheduling on parallel identical machines to minimize total tardiness

Cited In (9)

• 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
• Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness
• Integrated production and transportation scheduling with order-dependent inventory holding costs
• 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
• Heuristic algorithm for lot sizing and scheduling on identical parallel machines
• Scheduling with Fixed Delivery Dates
• Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints

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)