Solution of the Flowshop-Scheduling Problem with No Intermediate Queues

DOI10.1287/OPRE.20.3.689MaRDI QIDQ5652441zbMATH OpenOpenAlexFDO

Authors D. A. Wismer

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

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited in

(38)

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

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)