Algorithms for the flexible cyclic jobshop problem

This paper considers the cyclic jobshop problem in a flexible context where is objective is to find the minimum cycle time of a periodic schedule. The flexibility feature comes from the ability of the machines or robots to perform several kinds of tasks. Hence, the scheduling problem does not only c...

Full description

Saved in:
Bibliographic Details
Main Authors: Quinton, Felix, Hamaz, Idir, Houssin, Laurent
Format: Conference Proceeding
Language:English
Subjects:
Automation
Computer aided software engineering
Conferences
Heuristic algorithms
Robots
Schedules
Task analysis
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper considers the cyclic jobshop problem in a flexible context where is objective is to find the minimum cycle time of a periodic schedule. The flexibility feature comes from the ability of the machines or robots to perform several kinds of tasks. Hence, the scheduling problem does not only concern starting time of tasks but also on which machines the tasks will be performed. We propose an exact method to solve this problem and two heuristics.
ISSN:2161-8089
DOI:10.1109/COASE.2018.8560449