New complexity results on scheduling problem in a robotic cell

DOI10.1051/ro/2016053zbMath1384.90042OpenAlexW2511999325MaRDI QIDQ4603936

Moncef Abbas, Nacira Chikhi, Rachid Benmansour, Saïd Hanafi

Publication date: 23 February 2018

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2016053

zbMATH Keywords

complexitymakespanflowshopdynamic algorithmtranportation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Related Items

Survey and extensions of manufacturing models in two-stage flexible flow shops with dedicated machines

Cites Work

• A scheduling problem in blocking hybrid flow shop robotic cells with multiple robots
• Hybrid flowshop scheduling with interstage job transportation
• Two-machine flowshop scheduling problems involving a batching machine with transportation or deterioration consideration
• A two-stage flow shop scheduling problem with transportation considerations
• The strong NP-hardness of two-stage flowshop scheduling with a common second-stage machine
• Group-shop scheduling with sequence-dependent set-up and transportation times
• Two-stage hybrid flow shop scheduling with dynamic job arrivals
• Scheduling a two-machine robotic cell: A solvable case
• Scheduling of a Two-machine Flowshop with Travel Time Between Machines
• ON AN AUTOMATED TWO-MACHINE FLOWSHOP SCHEDULING PROBLEM WITH INFINITE BUFFER
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Machine scheduling with transportation considerations
• Makespan minimization for flow-shop problems with transportation times and a single robot