A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan

DOI10.1057/JORS.1994.65zbMATH Open0799.90060OpenAlexW4375905762MaRDI QIDQ4290641FDOQ4290641

Authors: Chandrasekharan Rajendran 

Publication date: 5 May 1994

Published in: The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/jors.1994.65

Recommendations

• Heuristic for no-wait flow shops with makespan minimization
• Heuristics for no-wait flowshops with makespan subject to mean completion time
• New heuristics for no-wait flowshops to minimize makespan.
• A FLOWSHOP SCHEDULING ALGORITHM TO MINIMIZE TOTAL FLOWTIME
• Heuristic algorithms for continuous flow-shop problem

zbMATH Keywords

heuristic algorithmmakespanconstrained flowshop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited In (48)

• A chaotic neural network algorithm for minimizing makespan in no-wait flow shop scheduling
• A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time
• Some local search algorithms for no-wait flow-shop problem with makespan criterion
• An enhanced differential evolution algorithm with fast evaluating strategies for TWT-NFSP with SSTs and RTs
• Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search
• Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion
• No-wait flowshops with bicriteria of makespan and total completion time
• Batch scheduling in the no-wait two-machine flowshop to minimize the makespan
• Title not available (Why is that?)
• Scheduling the Flowshop with Zero Intermediate Storage Using Chaotic Discrete Artificial Bee Algorithm
• An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time
• Concurrent flowshop scheduling to minimize makespan.
• New heuristics for no-wait flowshops to minimize makespan.
• Evolutionary hybrid particle swarm optimization algorithm for solving NP-hard no-wait flow shop scheduling problems
• Cyclic flow-shop scheduling with no-wait constraints and missing operations
• A hybrid harmony search algorithm for the no-wait flow-shop scheduling problems
• Scheduling two-machine no-wait open shops to minimize makespan
• Heuristic for no-wait flow shops with makespan minimization
• No-wait flowshops with bicriteria of makespan and maximum lateness.
• Lot sizing in a no-wait flow shop
• On the exact solution of the no-wait flow shop problem with due date constraints
• Sequencing of jobs in some production system
• Complete local search with limited memory algorithm for no-wait job shops to minimize makespan
• Study on MDIS algorithm for the no-wait flow-shop scheduling
• New heuristics for flow shop problem to minimize makespan
• Minimizing makespan for a no-wait flowshop using genetic algorithm
• No-wait job shop scheduling: tabu search and complexity of subproblems
• Heuristic algorithms for continuous flow-shop problem
• No-wait two-stage flowshop problem with multi-task flexibility of the first machine
• Scatter search with path relinking for the job shop with time lags and setup times
• Title not available (Why is that?)
• An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach
• COMPARISON OF SCHEDULING EFFICIENCY IN TWO/THREE-MACHINE NO-WAIT FLOW SHOP PROBLEM USING SIMULATED ANNEALING AND GENETIC ALGORITHM
• An improved water wave optimization algorithm with the single wave mechanism for the no-wait flow-shop scheduling problem
• A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems
• Minimisation of total tardiness for identical parallel machine scheduling using genetic algorithm
• Heuristics for no-wait flowshops with makespan subject to mean completion time
• Solving the continuous flow-shop scheduling problem by metaheuristics.
• Approximative procedures for no-wait job shop scheduling.
• Some effective heuristics for no-wait flowshops with setup times to minimize total completion time
• A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
• Heuristic for no-wait flow shops with makespan minimization based on total idle-time increments
• An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops
• On Eulerian extensions and their application to no-wait flowshop scheduling
• New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness
• Objective increment based metaheuristic for total flowtime minimization in no-wait flowshops
• The no-wait flow-shop paradox
• A survey of scheduling problems with no-wait in process

This page was built for publication: A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4290641)