No-Wait Flow Shop scheduling problem: a systematic literature review and bibliometric analysis
From MaRDI portal
(Redirected from Publication:6127701)
Recommendations
- A systematic literature review on no-idle flow shop scheduling problem
- A survey of scheduling problems with no-wait in process
- The hybrid flow shop scheduling problem
- An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
Cites work
- A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
- A hybrid harmony search algorithm for the no-wait flow-shop scheduling problems
- A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems
- A systematic review of multi-objective hybrid flow shop scheduling
- A two-machine no-wait flow shop problem with two competing agents
- Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion
- An efficient iterated greedy algorithm for a multi-objective no-wait flow shop problem with sequence dependent setup times
- An enhanced differential evolution algorithm with fast evaluating strategies for TWT-NFSP with SSTs and RTs
- An improved water wave optimization algorithm with the single wave mechanism for the no-wait flow-shop scheduling problem
- An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects
- COMPARISON OF SCHEDULING EFFICIENCY IN TWO/THREE-MACHINE NO-WAIT FLOW SHOP PROBLEM USING SIMULATED ANNEALING AND GENETIC ALGORITHM
- Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability
- Cyclic flow-shop scheduling with no-wait constraints and missing operations
- Evolutionary hybrid particle swarm optimization algorithm for solving NP-hard no-wait flow shop scheduling problems
- Heuristic for no-wait flow shops with makespan minimization based on total idle-time increments
- scientific article; zbMATH DE number 1910924 (Why is no real title available?)
- Makespan Minimization in No-Wait Flow Shops: A Polynomial Time Approximation Scheme
- Min–max regret criterion-based robust model for the permutation flow-shop scheduling problem
- Minimizing makespan for a no-wait flowshop using genetic algorithm
- Minimizing total tardiness in no-wait flowshops
- New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness
- No-wait flowshop scheduling problem with two criteria; total tardiness and makespan
- No-wait two-stage flowshop problem with multi-task flexibility of the first machine
- On the exact solution of the no-wait flow shop problem with due date constraints
- Optimal research and numerical simulation for scheduling no-wait flow shop in steel production
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Some heuristics for no-wait flowshops with total tardiness criterion
- Some local search algorithms for no-wait flow-shop problem with makespan criterion
- The Three-Machine No-Wait Flow Shop is NP-Complete
- The two-machine flowshop no-wait scheduling problem with a single server to minimize the total completion time
- Two-machine flow shop no-wait scheduling with a nonavailability interval
- Two-machine no-wait flow shop scheduling with missing operations
- Two-stage no-wait hybrid flowshop scheduling with inter-stage flexibility
- Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection
Cited in
(3)
This page was built for publication: No-Wait Flow Shop scheduling problem: a systematic literature review and bibliometric analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6127701)
