A review of TSP based approaches for flowshop scheduling

DOI10.1016/J.EJOR.2004.06.040zbMath1079.90048OpenAlexW2076390593MaRDI QIDQ2572854

Jatinder N. D. Gupta, Tapan P. Bagchi, Chelliah Skriskandarajah

Publication date: 4 November 2005

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2004.06.040

zbMATH Keywords

Traveling salesman problemManufacturingNP-hardRoboticFlowshop schedulingLimited bufferSetup timesBlocking no-wait flowshops

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35)

Related Items (18)

Scheduling semiconductor in-line steppers in new product/process introduction scenarios ⋮ Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs ⋮ A comprehensive review of flowshop group scheduling literature ⋮ The minimum backlog problem ⋮ A branch-and-cut approach for the distributed no-wait flowshop scheduling problem ⋮ Dynamic assignment of a multi-skilled workforce in job shops: an approximate dynamic programming approach ⋮ An asymmetric traveling salesman problem based matheuristic algorithm for flowshop group scheduling problem ⋮ Crane scheduling in railway yards: an analysis of computational complexity ⋮ Evolutionary algorithms for solving multi-objective travelling salesman problem ⋮ A survey of scheduling problems with no-wait in process ⋮ The \(x\)-and-\(y\)-axes travelling salesman problem ⋮ Manipulator motion planning for high-speed robotic laser cutting ⋮ New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness ⋮ The multiple shortest path problem with path deconfliction ⋮ Uma propriedade estrutural do problema de programação da produção flow shop permutacional com tempos de setup ⋮ The evolution of schematic representations of flow shop scheduling problems ⋮ Robotics and Control Systems ⋮ A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems

Uses Software

• Tabu search

Cites Work

• Part sequencing in three-machine no-wait robotic cells
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduling algorithms for flexible flowshops: Worst and average case performance
• Scheduling three-operation jobs in a two-machine flow shop to minimize makespan
• Scheduling dual gripper robotic cell: one-unit cycles
• Sequencing and scheduling in robotic cells: recent developments
• Scheduling subject to resource constraints: Classification and complexity
• The two-machine sequence dependent flowshop scheduling problem
• No-wait shop scheduling: Computational complexity and approximate algorithms
• A new heuristic method for the flow shop sequencing problem
• An adaptive branching rule for the permutation flow-shop problem
• A fast tabu search algorithm for the permutation flow-shop problem
• Minimizing makespan in a pallet-constrained flowshop
• Scheduling of parts and robot activities in a two machine robotic cell
• Heuristics for the flow line problem with setup costs
• Two-machine group scheduling problem with blocking and anticipatory setups
• The complexity of scheduling jobs in repetitive manufacturing systems
• Performance of scheduling algorithms for no-wait flowshops with parallel machines
• Optimal control of a class of DEDS: Flow-shops with state-dependent processing times
• Two-stage no-wait scheduling models with setup and removal times separated
• No-wait flow shop scheduling with large lot sizes
• Scheduling large robotic cells without buffers
• Scheduling and lot streaming in flowshops with no-wait in process
• Scheduling no-wait robotic cells with two and three machines
• A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups
• Scheduling a flowline manufacturing cell with sequence dependent family setup times
• Cyclic scheduling in robotic flowshops
• The flow shop with parallel machines: A tabu search approach
• The traveling salesman problem and its variations
• Two machine flow shop scheduling problem with no wait in process: Controllable machine speeds
• An enhanced TSP-based heuristic for makespan minimization in a flow shop with setup times
• Deterministic job-shop scheduling: Past, present and future
• A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem
• Simple algorithms for gilmore-gomory's traveling salesman and related problems
• Robotic cells with parallel machines: throughput maximization in constant travel-time cells
• Two-machine group scheduling problems in discrete parts manufacturing with sequence-dependent setups
• Optimal two- and three-stage production schedules with setup times included
• FLOWSHOP SCHEDULES WITH SEQUENCE DEPENDENT SETUP TIMES
• Sequencing in an Assembly Line with Blocking to Minimize Cycle Time
• Hierarchical Control Of The Two Processor Flow-Shop With State Dependent Processing Times: Complexity Analysis And Approximate Algorithms
• Some new results in flow shop scheduling
• A note on the flow-shop problem without interruptions in job processing
• Flowshop sequencing problems with limited buffer storage
• Scheduling Multiple Parts in a Robotic Cell Served by a Dual-Gripper Robot
• From EOQ Towards ZI
• The Three-Machine No-Wait Flow Shop is NP-Complete
• An Adaptable Scheduling Algorithm for Flexible Flow Lines
• A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
• Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
• Flowshop scheduling with limited temporary storage
• A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem
• Solvable Cases of the No-wait Flow-shop Scheduling Problem
• The Lessons of Flowshop Scheduling Research
• New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
• Sequencing Two-Machine Flow-Shops with Finite Intermediate Storage
• Optimal flowshop schedules with no intermediate storage space
• On general routing problems
• The Complexity of Flowshop and Jobshop Scheduling
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• The two-machine permutation flow shop with state-dependent processing times
• An Efficient Transformation Of The Generalized Traveling Salesman Problem
• Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
• Basic Techniques for Lot Streaming
• Scheduling in Robotic Cells: Classification, Two and Three Machine Cells
• Exact solution of large-scale, asymmetric traveling salesman problems
• Scheduling for parallel dedicated machines with a single server
• Minimizing Cycle Time in a Blocking Flowshop
• Scheduling in Robotic Cells: Heuristics and Cell Design
• Lower bounding schemes for flowshops with blocking in-process
• A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
• Scheduling of a Two-machine Flowshop with Processing Time Linearly Dependent on Job Waiting-time
• A Savings Index Heuristic Algorithm for Flowshop Scheduling with Sequence Dependent Set-up Times
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• A Functional Heuristic Algorithm for the Flowshop Scheduling Problem
• On the Flow-Shop Sequencing Problem with No Wait in Process^†
• Solution of the Flowshop-Scheduling Problem with No Intermediate Queues
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process

This page was built for publication: A review of TSP based approaches for flowshop scheduling