A review of TSP based approaches for flowshop scheduling (Q2572854): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Chelliah Skriskandarajah / rank
Normal rank
 
Property / author
 
Property / author: Chelliah Skriskandarajah / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Tabu search / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2004.06.040 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2076390593 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Cycle Time in a Blocking Flowshop / rank
 
Normal rank
Property / cites work
 
Property / cites work: No-wait flow shop scheduling with large lot sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling no-wait robotic cells with two and three machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Part sequencing in three-machine no-wait robotic cells / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling of parts and robot activities in a two machine robotic cell / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3607719 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023677 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling subject to resource constraints: Classification and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4396949 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution of large-scale, asymmetric traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4801179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131987 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4658190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic scheduling in robotic flowshops / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Savings Index Heuristic Algorithm for Flowshop Scheduling with Sequence Dependent Set-up Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing and scheduling in robotic cells: recent developments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling dual gripper robotic cell: one-unit cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lessons of Flowshop Scheduling Research / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing Two-Machine Flow-Shops with Finite Intermediate Storage / rank
 
Normal rank
Property / cites work
 
Property / cites work: A review and classification of heuristics for permutation flow-shop scheduling with makespan objective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Flowshop and Jobshop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robotic cells with parallel machines: throughput maximization in constant travel-time cells / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Insertion and Postoptimization Procedures for the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling for parallel dedicated machines with a single server / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133147 / rank
 
Normal rank
Property / cites work
 
Property / cites work: No-wait shop scheduling: Computational complexity and approximate algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5675146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Functional Heuristic Algorithm for the Flowshop Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal flowshop schedules with no intermediate storage space / rank
 
Normal rank
Property / cites work
 
Property / cites work: FLOWSHOP SCHEDULES WITH SEQUENCE DEPENDENT SETUP TIMES / rank
 
Normal rank
Property / cites work
 
Property / cites work: The two-machine sequence dependent flowshop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-stage no-wait scheduling models with setup and removal times separated / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling three-operation jobs in a two-machine flow shop to minimize makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem and its variations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling in Robotic Cells: Classification, Two and Three Machine Cells / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling and lot streaming in flowshops with no-wait in process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic job-shop scheduling: Past, present and future / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal two- and three-stage production schedules with setup times included / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461912 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461913 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling in Robotic Cells: Heuristics and Cell Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of scheduling jobs in repetitive manufacturing systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3339651 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3940839 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop sequencing problems with limited buffer storage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine group scheduling problem with blocking and anticipatory setups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine group scheduling problems in discrete parts manufacturing with sequence-dependent setups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3358512 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing in an Assembly Line with Blocking to Minimize Cycle Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Transformation Of The Generalized Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The flow shop with parallel machines: A tabu search approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast tabu search algorithm for the permutation flow-shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop scheduling with limited temporary storage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive branching rule for the permutation flow-shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Flow-Shop Sequencing Problem with No Wait in Process<sup>†</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: On general routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An enhanced TSP-based heuristic for makespan minimization in a flow shop with setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the flow line problem with setup costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Three-Machine No-Wait Flow Shop is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some new results in flow shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3670909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounding schemes for flowshops with blocking in-process / rank
 
Normal rank
Property / cites work
 
Property / cites work: A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4051864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a flowline manufacturing cell with sequence dependent family setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan in a pallet-constrained flowshop / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4239706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance of scheduling algorithms for no-wait flowshops with parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Multiple Parts in a Robotic Cell Served by a Dual-Gripper Robot / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling of a Two-machine Flowshop with Processing Time Linearly Dependent on Job Waiting-time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling large robotic cells without buffers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling algorithms for flexible flowshops: Worst and average case performance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchical Control Of The Two Processor Flow-Shop With State Dependent Processing Times: Complexity Analysis And Approximate Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two machine flow shop scheduling problem with no wait in process: Controllable machine speeds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4404442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the flow-shop problem without interruptions in job processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3806968 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Basic Techniques for Lot Streaming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple algorithms for gilmore-gomory's traveling salesman and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solvable Cases of the No-wait Flow-shop Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The two-machine permutation flow shop with state-dependent processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal control of a class of DEDS: Flow-shops with state-dependent processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new heuristic method for the flow shop sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of the Flowshop-Scheduling Problem with No Intermediate Queues / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Adaptable Scheduling Algorithm for Flexible Flow Lines / rank
 
Normal rank
Property / cites work
 
Property / cites work: From EOQ Towards ZI / rank
 
Normal rank

Revision as of 09:13, 11 June 2024

scientific article
Language Label Description Also known as
English
A review of TSP based approaches for flowshop scheduling
scientific article

    Statements

    A review of TSP based approaches for flowshop scheduling (English)
    0 references
    0 references
    0 references
    4 November 2005
    0 references
    Manufacturing
    0 references
    Flowshop scheduling
    0 references
    NP-hard
    0 references
    Robotic
    0 references
    Limited buffer
    0 references
    Blocking no-wait flowshops
    0 references
    Setup times
    0 references
    Traveling salesman problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers