No-wait flowshops with bicriteria of makespan and maximum lateness.
From MaRDI portal
Publication:1410329
DOI10.1016/S0377-2217(02)00646-XzbMath1044.90040OpenAlexW1966577583MaRDI QIDQ1410329
Ali Allahverdi, Tariq A. Aldowaisan
Publication date: 14 October 2003
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00646-x
Management decision making, including multiple objectives (90B50) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (15)
Common due date assignment scheduling for a no-wait flowshop with convex resource allocation and learning effect ⋮ On no-wait and no-idle flow shops with makespan criterion ⋮ 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 ⋮ Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion ⋮ New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness ⋮ No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan ⋮ Approximation algorithms for minimizing the maximum lateness and makespan on parallel machines ⋮ A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems ⋮ COMPARISON OF SCHEDULING EFFICIENCY IN TWO/THREE-MACHINE NO-WAIT FLOW SHOP PROBLEM USING SIMULATED ANNEALING AND GENETIC ALGORITHM ⋮ Flowshop-scheduling problems with makespan criterion: a review ⋮ A two-machine no-wait flow shop problem with two competing agents
Cites Work
- Unnamed Item
- Minimizing total tardiness in permutation flowshops
- A bicriteria two-machine permutation flowshop problem
- A new branch-and-bound approach for the \(n/2\)/flowshop/\(\alpha F+\beta C_{\text{max}}\) flowshop scheduling problem
- A combined branch-and bound and genetic algorithm based approach for a flowshop scheduling problem
- Some new results in flow shop scheduling
- Solutions to the Constrained Flowshop Sequencing Problem
- A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan
- A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling Problem
- On the Flow-Shop Sequencing Problem with No Wait in Process†
- Solution of the Flowshop-Scheduling Problem with No Intermediate Queues
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
This page was built for publication: No-wait flowshops with bicriteria of makespan and maximum lateness.