Preemptive scheduling in the presence of transportation times

DOI10.1016/J.COR.2008.09.006MaRDI QIDQ1010294zbMATH OpenOpenAlexFDO

Authors 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

complexityheuristicsidentical parallel machinesmakespanmigration delaypreemptiontransportation time

Mathematics Subject Classification ID

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

Recommendations

• Scheduling on parallel machines with preemption and transportation delays
• Parallel machine scheduling problem with preemptive jobs and transportation delay
• Preemptive scheduling on two identical parallel machines with a single transporter
• Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays
• Complexity of preemptive minsum scheduling on unrelated parallel machines

Cites work

• Algorithms – ESA 2005
• APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS
• scientific article; zbMATH DE number 3989090 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 736667 (Why is no real title available?)
• scientific article; zbMATH DE number 1128827 (Why is no real title available?)
• scientific article; zbMATH DE number 830382 (Why is no real title available?)
• Scheduling parallel jobs to minimize the makespan

Cited in

(11)

• Scheduling on parallel machines with preemption and transportation delays
• Preemptive scheduling on two identical parallel machines with a single transporter
• A simulated multi-objective model for flexible job shop transportation scheduling
• Solving flexible job shop scheduling problems with transportation time based on improved genetic algorithm
• Scheduling flexible job-shops with transportation times: mathematical models and a hybrid imperialist competitive algorithm
• Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time
• Transporting jobs through a processing center with two parallel machines
• Parallel machine scheduling problem with preemptive jobs and transportation delay
• scientific article; zbMATH DE number 2223042 (Why is no real title available?)
• Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays
• Scheduling in manufacturing with transportation: classification and solution techniques

This page was built for publication: Preemptive scheduling in the presence of transportation times

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