Scheduling is an important process widely used in manufacturing, production, management, computer science, and so on. Appropriate scheduling not only reduces manufacturing costs but also reduces possibilities for violating due dates. Finding good schedules for given sets of jobs can thus help factory supervisors effectively control job flows and provide solutions for job sequencing. In simple f...

An extended version of the flexible job shop problem is tackled in this work. The considered extension to the classical flexible job shop problem allows the precedences between the operations to be given by an arbitrary directed acyclic graph instead of a linear order. Therefore, the problem consists of allocating the operations to the machines and sequencing them in compliance with the given p...

We introduce the multiple capacitated job shop scheduling problem as a generalization of the job shop scheduling problem. In this problem machines may process several operations simultaneously. We present an algorithm based on constraint satisfaction techniques to handle the problem e ectively. The most important novel feature of our algorithm is the consistency checking. An empirical performan...

This paper describes the radiotherapy patient scheduling problem of minimising waiting times. Like many other service industry problems, radiotherapy patient scheduling may be solved by first modelling and formulating it into a shop scheduling problem. Over the years, these shop scheduling models have been researched and solved using various approaches. This paper typifies radiotherapy patient ...

Volvo Aero has invested in a complex production cell containing a set of multipurpose machines. The problem of finding optimal schedules for this multitask cell is a complex combinatorial optimization problem which is recognized as a flexible job shop problem. This thesis proposes an approach to find such schedules using mathematical optimization. The mathematical models developed so far are pr...

The problem of efficiently scheduling production jobs on several machines is an important consideration when attempting to make effective use of a multimachines system such as a flexible job shop scheduling production system (FJSP). In most of its practical formulations, the FJSP is known to be NP-hard [8][9], so exact solution methods are unfeasible for most problem instances and heuristic app...

Scheduling is a scientific domain concerning the allocation of limited tasks over time. The goal of scheduling is to maximize (or minimize) different criteria of a facility as makespan, occupation rate of a machine, total tardiness ... In this area, scientific community usually group the problem with, on one hand the system studied, defining the number of machines (one machine, parallel machine...

Stochastic flexible flow shop scheduling problem (SFFSSP) is one the main focus of researchers due to the complexity arises from inherent uncertainties and also the difficulty of solving such NP-hard problems. Conventionally, in such problems each machine’s job process time may encounter uncertainty due to their relevant random behaviour. In order to examine such problems more realistically, fi...