1125 search results - page 6 / 225 » On the job rotation problem |
LATIN
2000
Springer
14 years 3 days ago
2000
Springer
The Flexible Job Shop problem is a generalization of the classical job shop scheduling problem in which for every operation there is a group of machines that can process it. The p...
CPAIOR
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We propose a new solution approach for the Job Shop Problem with Sequence Dependent Setup Times (SDST-JSP). The problem consists in scheduling jobs, each job being a set ...
COR
2010
13 years 8 months ago
2010
The Flexible Job Shop scheduling Problem (FJSP) is a generalization of the classical Job Shop Problem in which each operation must be processed on a given machine chosen among a f...
EOR
2007
13 years 8 months ago
2007
Consider a single machine and a set of jobs that are available for processing at time 0. Job ¡ has a processing time ¢¤£ , a due date ¥¦£ and a weight §¨£ . We consid...
CEC
2007
IEEE
14 years 16 days ago
2007
IEEE
In this paper, we present an ant system algorithm variant designed to solve the job shop scheduling problem. The proposed approach is based on a recent biological study which showe...