• Aucun résultat trouvé

Job shop scheduling

Genetic algorithms for the job-shop scheduling problem with parallel machines and precedence constraints.: heuristic mixing method

Genetic algorithms for the job-shop scheduling problem with parallel machines and precedence constraints.: heuristic mixing method

... generalized job-shop scheduling problem with several unrelated parallel machines and precedence constraints (corresponding to linear and non-linear process routings) between the operations of the ...

11

Evaluation of a new decision-aid parameter for job shop scheduling under uncertainties

Evaluation of a new decision-aid parameter for job shop scheduling under uncertainties

... local job-shop scheduling rules. Industrial scheduling, pages 225–251, ...and Scheduling, ICAPS 2010, Toronto, Ontario, Canada, May 12-16, 2010, pages 73–80, ...for scheduling a ...

23

A genetic algorithm approach to job shop scheduling problems with a batch allocation issue

A genetic algorithm approach to job shop scheduling problems with a batch allocation issue

... the job shop scheduling problem with a batch allocation ...obtain job schedules on each machine. The job schedules with batch size are developed using dispatching ...for job ...

9

Solving a multi-periods job-shop scheduling problem using a generic decision support tool

Solving a multi-periods job-shop scheduling problem using a generic decision support tool

... or scheduling problems is ...multi-period job-shop scheduling problem proposed by a case study company which produces refrigerated foodservice ...or scheduling problems variants, ...

10

GPU-Based Two Level Parallel B&B for the Blocking Job Shop Scheduling Problem

GPU-Based Two Level Parallel B&B for the Blocking Job Shop Scheduling Problem

... blocking job shop scheduling (BJSS) problem, which is a version of classical job shop scheduling problem with no intermediate buffer between ...Keywords-Job shop; ...

10

Job shop scheduling with setup times and maximal time-lags: A simple constraint programming approach

Job shop scheduling with setup times and maximal time-lags: A simple constraint programming approach

... Introduction Scheduling problems have proven fertile research ground for constraint programming and other combinatorial optimization ...open shop scheduling and job shop ...

16

Modelling and Solving a Practical Flexible Job-Shop Scheduling Problem with Blocking Constraints

Modelling and Solving a Practical Flexible Job-Shop Scheduling Problem with Blocking Constraints

... Provence, 880 avenue de Mimet, F-13541 Gardanne – France. Email: Dauzere-Peres@emse.fr (Received 00 Month 200x; final version received 00 Month 200x) This paper aims at presenting the study of a practical ...

21

A Dynamic Approach to Multi-stage Job Shop Scheduling in an Industry 4.0-Based Flexible Assembly System

A Dynamic Approach to Multi-stage Job Shop Scheduling in an Industry 4.0-Based Flexible Assembly System

... of scheduling theory, we study a multi-objective, multi-stage job shop scheduling problem with alternative machines at each stage of the technological pro- cess with different time-dependent ...

9

Models and Strategies for Variants of the Job Shop Scheduling Problem

Models and Strategies for Variants of the Job Shop Scheduling Problem

... classical job shop scheduling problem, one can consider tasks in any order compatible with the jobs and schedule them to their earliest possible start ...however, scheduling early tasks of a ...

16

Complex Job-Shop Scheduling with Batching in Semiconductor Manufacturing

Complex Job-Shop Scheduling with Batching in Semiconductor Manufacturing

... are scheduling decisions that decide which machine is used to process a lot, which lots are grouped in the same batch, and in which order lots are processed on their assigned ...(2013)). Scheduling takes a ...

181

An artificial intelligence approach to job-shop scheduling

An artificial intelligence approach to job-shop scheduling

... Each time the search operator is invoked on a given schedule (parent node), it generates successor schedules (successor nodes) for all of the load options. The generation of a succe[r] ...

52

Combining heuristics and integer programming for optimizing job shop scheduling models

Combining heuristics and integer programming for optimizing job shop scheduling models

... One of the future areas of research can be, instead of using Benders' Decomposition to get the lower bound and a new set of assumptions, to use Dual Heuristics which can[r] ...

49

A Broader View of the Job-Shop Scheduling Problem

A Broader View of the Job-Shop Scheduling Problem

... In this paper we propose a somewhat broader scheduling problem that considers three scheduling decisions (due-date setting, job release, and priority sequencing) and [r] ...

34

A Survey on Parallel Genetic Algorithms for Shop Scheduling Problems

A Survey on Parallel Genetic Algorithms for Shop Scheduling Problems

... method, which was a software development framework aimed at developing multi- agent systems. Compared with the serial agent-based GA, the suggested algorithm not only obtained much short schedule lengths, but also had ...

9

A GRASPxELS for Scheduling of Job-Shop Like Manufacturing Systems and CO2 Emission Reduction

A GRASPxELS for Scheduling of Job-Shop Like Manufacturing Systems and CO2 Emission Reduction

... a job-shop scheduling problem where machines can work at different ...classical job- shop scheduling problem, where each operation has to be executed by one machine and this ...

9

Le retard algébrique maximum dans un job shop

Le retard algébrique maximum dans un job shop

... [1] Ebru Demirkol, Sanjay Mehta, and Reha Uzsoy. A computational study of shifting bottleneck procedures forshop scheduling problems. Journal of Heuristics, 3(2) :111–137, 1997. [2] A. S. Jain and S. Meeran. ...

3

Schedule generation schemes for the job-shop problem with sequence-dependent setup times: dominance properties and computational analysis

Schedule generation schemes for the job-shop problem with sequence-dependent setup times: dominance properties and computational analysis

... for scheduling, or/and where the start time of the scheduled operation could be modified at a later ...classical job-shop problem (Baker (1974)), the serial and parallel SGSs [13]) and the strict ...

45

The two-machine flow-shop serial-batching scheduling problem with limited batch size

The two-machine flow-shop serial-batching scheduling problem with limited batch size

... max r=1,...,h p(B r 0 ) ≤ max r=1,...,h p(B r ) and we have C max (π 0 ) ≤ C max (π), which means that π 0 is also optimal. By repeating the same procedure at most n/2 times, we obtain a solution satisfying the ...

9

Size-based disciplines for job scheduling in data-intensive scalable computing systems

Size-based disciplines for job scheduling in data-intensive scalable computing systems

... between job size and it estimate of ...the job size distribution is unknown. When the job size distribution is exponential (shape = 1), non size-based scheduling policies perform analogously; ...

123

Real time distributed shop floor scheduling using an agent-based service-oriented architecture

Real time distributed shop floor scheduling using an agent-based service-oriented architecture

... Workcell Scheduling Problem In the workcell scheduling problem setting, workcells are implemented by FMS ...FMS scheduling models, we focus our attention on a class of problems in which machines have ...

28

Show all 899 documents...

Sujets connexes