Total completion time minimization in a computer system with a server and two parallel processors

DOI10.1016/j.cor.2003.08.007zbMath1077.90024OpenAlexW2051705648MaRDI QIDQ1886864

S. Guirchoun, Jean-Charles Billaut, Patrick Martineau

Publication date: 19 November 2004

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

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

zbMATH Keywords

SchedulingHybrid flow shopParallel machinesSingle server

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Mixed integer programming formulations for the biomass truck scheduling problem ⋮ Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective ⋮ A survey of scheduling problems with no-wait in process ⋮ The two-machine flowshop no-wait scheduling problem with a single server to minimize the total completion time ⋮ The hybrid flow shop scheduling problem ⋮ No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan

Cites Work

• Unnamed Item
• Parallel machine scheduling problems with a single server
• Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
• Parallel machine scheduling with a common server
• A heuristic algorithm for minimizing mean flow time with unit setups
• Scheduling two parallel semiautomatic machines to minimize machine interference
• Two-Stage, Hybrid Flowshop Scheduling Problem
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling for parallel dedicated machines with a single server
• Les problèmes d'ordonnancement de type flow-shop hybride : état de l'art