Scheduling on parallel machines with preemption and transportation delays
From MaRDI portal
Publication:1761986
DOI10.1016/J.COR.2011.04.013zbMATH Open1251.90151OpenAlexW2045358932MaRDI QIDQ1761986FDOQ1761986
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
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
Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Marketing, advertising (90B60)
Cites Work
- Title not available (Why is that?)
- A survey of hard real-time scheduling for multiprocessor systems
- Machine scheduling with transportation considerations
- When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
- Title not available (Why is that?)
- Scheduling
- Proportionate progress: A notion of fairness in resource allocation
- Scheduling algorithms
- Scheduling with deadlines and loss functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithms – ESA 2005
- Preemptive scheduling in the presence of transportation times
- UET scheduling with unit interprocessor communication delays
- Resolution of a scheduling problem in a flowshop robotic cell
- Optimal Preemptive Scheduling on Two-Processor Systems
- Scheduling three chains on two parallel machines
- APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS
- Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation
Cited In (6)
- Scheduling in manufacturing with transportation: classification and solution techniques
- Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays
- Parallel machine scheduling problem with preemptive jobs and transportation delay
- 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)
