Solution of the Flowshop-Scheduling Problem with No Intermediate Queues
From MaRDI portal
Publication:5652441
DOI10.1287/opre.20.3.689zbMath0241.90031OpenAlexW1996800651MaRDI QIDQ5652441
Publication date: 1972
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.20.3.689
Related Items
Some no-wait shops scheduling problems: Complexity aspect, Incorporating preventive maintenance into the m-machine no-wait flow-shop scheduling problem with total flow-time minimization: a computational study, Some local search algorithms for no-wait flow-shop problem with makespan criterion, Scheduling in supply chain environment, Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search, Scatter search with path relinking for the job shop with time lags and setup times, Lot sizing in a no-wait flow shop, On the exact solution of the no-wait flow shop problem with due date constraints, 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, Applications of max-plus algebra to flow shop scheduling problems, An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time, 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., The Directed Minimum Latency Problem, Batch scheduling in a two-machine flow shop with limited buffer, 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, The optimization of dynamical systems, Scheduling two-machine no-wait open shops to minimize makespan, Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion, An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach, New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness, No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem, Two machine flow shop scheduling problem with no wait in process: Controllable machine speeds, 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, Minimizing makespan for a no-wait flowshop using genetic algorithm, Complete local search with limited memory algorithm for no-wait job shops to minimize makespan, A survey of optimal control of distributed-parameter systems, Flow-Shop Sequencing with no Intratnachine Waiting: Minimization of Total Waiting Cost, A review of TSP based approaches for flowshop scheduling, Two models for a family of flowshop sequencing problems, SCHEDULING TWO-MACHINE FLOW SHOPS WITH EXACT DELAYS, The no-wait flow-shop paradox
