No-Wait Flow Shop scheduling problem: a systematic literature review and bibliometric analysis

DOI10.1051/RO/2024008OpenAlexW4390578079MaRDI QIDQ6127701

Unnamed Author, Unnamed Author, Unnamed Author

Publication date: 14 April 2024

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2024008

zbMATH Keywords

schedulingpermutationflow shopno-waithybriddistributed

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Some heuristics for no-wait flowshops with total tardiness criterion
• Minimizing makespan for a no-wait flowshop using genetic algorithm
• Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion
• A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems
• On the exact solution of the no-wait flow shop problem with due date constraints
• Two-stage no-wait hybrid flowshop scheduling with inter-stage flexibility
• No-wait flowshop scheduling problem with two criteria; total tardiness and makespan
• Optimal research and numerical simulation for scheduling no-wait flow shop in steel production
• No-wait two-stage flowshop problem with multi-task flexibility of the first machine
• A two-machine no-wait flow shop problem with two competing agents
• Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection
• Cyclic flow-shop scheduling with no-wait constraints and missing operations
• An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects
• An enhanced differential evolution algorithm with fast evaluating strategies for TWT-NFSP with SSTs and RTs
• Heuristic for no-wait flow shops with makespan minimization based on total idle-time increments
• Some local search algorithms for no-wait flow-shop problem with makespan criterion
• A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
• The two-machine flowshop no-wait scheduling problem with a single server to minimize the total completion time
• Evolutionary hybrid particle swarm optimization algorithm for solving NP-hard no-wait flow shop scheduling problems
• Two-Machine No-Wait Flow Shop Scheduling with Missing Operations
• A HYBRID HARMONY SEARCH ALGORITHM FOR THE NO-WAIT FLOW-SHOP SCHEDULING PROBLEMS
• Minimizing total tardiness in no-wait flowshops
• New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness
• Two-machine flow shop no-wait scheduling with a nonavailability interval
• COMPARISON OF SCHEDULING EFFICIENCY IN TWO/THREE-MACHINE NO-WAIT FLOW SHOP PROBLEM USING SIMULATED ANNEALING AND GENETIC ALGORITHM
• The Three-Machine No-Wait Flow Shop is NP-Complete
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Makespan Minimization in No-Wait Flow Shops: A Polynomial Time Approximation Scheme
• Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability
• An improved water wave optimization algorithm with the single wave mechanism for the no-wait flow-shop scheduling problem
• Min–max regret criterion-based robust model for the permutation flow-shop scheduling problem
• A systematic review of multi-objective hybrid flow shop scheduling
• An efficient iterated greedy algorithm for a multi-objective no-wait flow shop problem with sequence dependent setup times

This page was built for publication: No-Wait Flow Shop scheduling problem: a systematic literature review and bibliometric analysis