Abstract
AbstractIn this paper, we deal with the cyclic scheduling problem. More precisely, we consider the cyclic job shop with assembly tasks. Such a problem is made of several jobs, each job consisting of tasks (assembly/disassembly tasks and transformation tasks) being assigned to machines in a cyclic way. This kind of scheduling problem is well fitted to medium and large production demands, since the cyclic behavior can avoid the scheduling of the whole tasks by considering only a small temporal window (cycle). Thus, cyclic scheduling is a heuristic to solve the scheduling problems whose complexity is NP-hard in the general case. Many methods have been proposed to solve the cyclic scheduling problem. Among them, we focus on the mathematical programming approach. We will propose here a mathematical model for cyclic scheduling with assembly tasks and Work-In-Process minimization, and we illustrate this approach with an example from literature.KeywordsSchedule ProblemCycle TimeFlexible Manufacture SystemAssembly TaskCyclic ScheduleThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
