Scheduling on parallel machines with preemption and transportation delays

DOI10.1016/j.cor.2011.04.013zbMath1251.90151OpenAlexW2045358932MaRDI QIDQ1761986

Mourad Boudhar, Ameur Soukhal, Amina Haned, 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

schedulingparallel machinesNP-completenesspreemptionFPTASdynamic programtransportation delays

Mathematics Subject Classification ID

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

Related Items (1)

Parallel machine scheduling problem with preemptive jobs and transportation delay

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Preemptive scheduling in the presence of transportation times
• Scheduling three chains on two parallel machines
• UET scheduling with unit interprocessor communication delays
• Resolution of a scheduling problem in a flowshop robotic cell
• Proportionate progress: A notion of fairness in resource allocation
• Scheduling with Deadlines and Loss Functions
• A survey of hard real-time scheduling for multiprocessor systems
• When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
• Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation
• APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS
• Algorithms – ESA 2005
• Optimal Preemptive Scheduling on Two-Processor Systems
• Scheduling
• Machine scheduling with transportation considerations

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