Flowshop/no-idle scheduling to minimise the mean flowtime

DOI10.1017/S1446181100010026zbMath1123.90313MaRDI QIDQ3365661

Laxmi Narain, P. C. Bagga

Publication date: 23 January 2006

Published in: The ANZIAM Journal (Search for Journal in Brave)

Full work available at URL: http://www.austms.org.au/Publ/ANZIAM/V47P2/2126.html

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items (3)

A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem ⋮ A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion ⋮ Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion

Cites Work

• Unnamed Item
• Total flowtime in no-wait flowshops with separated setup times.
• Optimal two- and three-stage production schedules with setup times included
• Solvable Cases of the No-wait Flow-shop Scheduling Problem
• The Complexity of Flowshop and Jobshop Scheduling
• Minimizing total completion time in a no-wait flowshop with sequence-dependent additive changeover times
• Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times
• Branch-and-Bound Methods: A Survey
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process

This page was built for publication: Flowshop/no-idle scheduling to minimise the mean flowtime