Scheduling on parallel machines with preemption and transportation delays

DOI10.1016/J.COR.2011.04.013MaRDI QIDQ1761986zbMATH OpenOpenAlexFDO

Authors Amina Haned, A. Soukhal, Mourad Boudhar, Nguyen Huynh Tuong

Publication date 15 November 2012

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

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

zbMATH Keywords

FPTASNP-completenesspreemptionschedulingparallel machinesdynamic programtransportation delays

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Marketing, advertising (90B60)

Recommendations

• Parallel machine scheduling problem with preemptive jobs and transportation delay
• Preemptive scheduling in the presence of transportation times
• Preemptive scheduling on two identical parallel machines with a single transporter
• Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays
• Algorithms – ESA 2005

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1128827 (Why is no real title available?)
• scientific article; zbMATH DE number 751135 (Why is no real title available?)
• scientific article; zbMATH DE number 2109192 (Why is no real title available?)
• A survey of hard real-time scheduling for multiprocessor systems
• APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS
• Algorithms – ESA 2005
• Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation
• Machine scheduling with transportation considerations
• Optimal Preemptive Scheduling on Two-Processor Systems
• Preemptive scheduling in the presence of transportation times
• Proportionate progress: A notion of fairness in resource allocation
• Resolution of a scheduling problem in a flowshop robotic cell
• Scheduling
• Scheduling algorithms
• Scheduling three chains on two parallel machines
• Scheduling with deadlines and loss functions
• UET scheduling with unit interprocessor communication delays
• When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?

Cited in

(6)

• Scheduling in manufacturing with transportation: classification and solution techniques
• Parallel machine scheduling problem with preemptive jobs and transportation delay
• Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays
• Transporting jobs through a processing center with two parallel machines
• Preemptive scheduling on two identical parallel machines with a single transporter
• Preemptive scheduling in the presence of transportation times

This page was built for publication: Scheduling on parallel machines with preemption and transportation delays

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