Preemptive scheduling in the presence of transportation times

DOI10.1016/j.cor.2008.09.006zbMath1179.90126OpenAlexW2079535025MaRDI QIDQ1010294

Mourad Boudhar, Amina Haned

Publication date: 3 April 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2008.09.006

zbMATH Keywords

complexityheuristicsmakespanidentical parallel machinespreemptionmigration delaytransportation time

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)

Related Items

A simulated multi-objective model for flexible job shop transportation scheduling ⋮ Parallel machine scheduling problem with preemptive jobs and transportation delay ⋮ Solving flexible job shop scheduling problems with transportation time based on improved genetic algorithm ⋮ Scheduling on parallel machines with preemption and transportation delays ⋮ Scheduling flexible job-shops with transportation times: mathematical models and a hybrid imperialist competitive algorithm

Cites Work

• Scheduling parallel jobs to minimize the makespan
• APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS
• Algorithms – ESA 2005
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item