No-wait flowshops with bicriteria of makespan and total completion time
From MaRDI portal
Publication:4656717
DOI10.1057/palgrave.jors.2601403zbMath1139.90360OpenAlexW2017443180MaRDI QIDQ4656717
Ali Allahverdi, Tariq A. Aldowaisan
Publication date: 14 March 2005
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601403
Related Items
A branch-and-bound algorithm for the three-machine flowshop scheduling problem with bicriteria of makespan andtotal flowtime ⋮ A note on minimizing maximum lateness in a two-machine no-wait flowshop ⋮ Total completion time with makespan constraint in no-wait flowshops with setup times ⋮ Common due date assignment scheduling for a no-wait flowshop with convex resource allocation and learning effect ⋮ A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime ⋮ Algorithms for a two‐machine flowshop problem with jobs of two classes ⋮ An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time ⋮ Minimizing total tardiness in no-wait flowshops ⋮ Flow Shop Resource Allocation Scheduling with Due Date Assignment, Learning Effect and Position-Dependent Weights ⋮ A bicriteria flowshop scheduling with a learning effect ⋮ No-wait flowshop scheduling problem with two criteria; total tardiness and makespan ⋮ A survey of scheduling problems with no-wait in process ⋮ Heuristics for no-wait flowshops with makespan subject to mean completion time ⋮ New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness ⋮ COMPARISON OF SCHEDULING EFFICIENCY IN TWO/THREE-MACHINE NO-WAIT FLOW SHOP PROBLEM USING SIMULATED ANNEALING AND GENETIC ALGORITHM ⋮ A two-machine no-wait flow shop problem with two competing agents ⋮ A robust two-machine flow-shop scheduling model with scenario-dependent processing times
