Minimum deviation algorithm for two-stage no-wait flowshops with parallel machines

DOI10.1016/j.camwa.2003.08.003zbMath1057.90023OpenAlexW2056876820MaRDI QIDQ1767900

Jiefang Dong, Jinxing Xie, Zhixin Liu, Wen-Xun Xing

Publication date: 8 March 2005

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2003.08.003

zbMATH Keywords

SchedulingFlowshopHeuristicNo-waitParallel machine

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (3)

Two-stage no-wait hybrid flowshop scheduling with inter-stage flexibility ⋮ A survey of scheduling problems with no-wait in process ⋮ The hybrid flow shop scheduling problem

Cites Work

• Unnamed Item
• Scheduling algorithms for flexible flowshops: Worst and average case performance
• Some no-wait shops scheduling problems: Complexity aspect
• A hybrid two-stage flowshop with part family, batch production, major and minor set-ups
• Performance of scheduling algorithms for no-wait flowshops with parallel machines
• Optimal two- and three-stage production schedules with setup times included
• On the Membership Problem of the Pedigree Polytope
• Two-Stage, Hybrid Flowshop Scheduling Problem
• An Adaptable Scheduling Algorithm for Flexible Flow Lines
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process

This page was built for publication: Minimum deviation algorithm for two-stage no-wait flowshops with parallel machines