Solution of the Flowshop-Scheduling Problem with No Intermediate Queues

Cited in

(38)

Complete local search with limited memory algorithm for no-wait job shops to minimize makespan
Some no-wait shops scheduling problems: Complexity aspect
The optimization of dynamical systems
No-wait flowshops with bicriteria of makespan and maximum lateness.
Solving the continuous flow-shop scheduling problem by metaheuristics.
New heuristics for no-wait flowshops to minimize makespan.
Approximative procedures for no-wait job shop scheduling.
Batch scheduling in a two-machine flow shop with limited buffer and sequence independent setup times and removal times.
On the exact solution of the no-wait flow shop problem with due date constraints
Applications of max-plus algebra to flow shop scheduling problems
Two machine flow shop scheduling problem with no wait in process: Controllable machine speeds
Two models for a family of flowshop sequencing problems
Lot sizing in a no-wait flow shop
Some local search algorithms for no-wait flow-shop problem with makespan criterion
Some effective heuristics for no-wait flowshops with setup times to minimize total completion time
No-wait job shop scheduling: tabu search and complexity of subproblems
An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops
An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach
A survey of optimal control of distributed-parameter systems
A review of TSP based approaches for flowshop scheduling
Scheduling in supply chain environment
New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness
Scatter search with path relinking for the job shop with time lags and setup times
COMPARISON OF SCHEDULING EFFICIENCY IN TWO/THREE-MACHINE NO-WAIT FLOW SHOP PROBLEM USING SIMULATED ANNEALING AND GENETIC ALGORITHM
SCHEDULING TWO-MACHINE FLOW SHOPS WITH EXACT DELAYS
Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search
The Directed Minimum Latency Problem
Flow-Shop Sequencing with no Intratnachine Waiting: Minimization of Total Waiting Cost
Incorporating preventive maintenance into the m-machine no-wait flow-shop scheduling problem with total flow-time minimization: a computational study
Flowshop-scheduling problems with makespan criterion: a review
An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time
Batch scheduling in a two-machine flow shop with limited buffer
Scheduling two-machine no-wait open shops to minimize makespan
Minimizing makespan for a no-wait flowshop using genetic algorithm
The no-wait flow-shop paradox
On no-wait and no-idle flow shops with makespan criterion
Mixed binary integer programming formulations for the flow shop scheduling problems. A case study: ISD projects scheduling
Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion

This page was built for publication: Solution of the Flowshop-Scheduling Problem with No Intermediate Queues

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