2004
DOI: 10.1007/s00170-004-2114-7
|View full text |Cite
|
Sign up to set email alerts
|

Conjunctive simulated scheduling

Abstract: The scheduling of highly complex job shops, such as those found in semiconductor manufacturing, involves multiple types of work centers, large and changing varieties of the products, sequence dependent set up times, reentrant process flow, dynamically changing environment, etc. These complexities make the job shop scheduling problem very strongly nondeterministic polynominally (NP)-hard and intractable to solve by the traditional scheduling approaches. This paper presents the concept and applications of the co… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
12
0

Year Published

2006
2006
2020
2020

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 23 publications
(12 citation statements)
references
References 18 publications
0
12
0
Order By: Relevance
“…They also mentioned the standard deviation of C max and the minimization of the sum of the completion time of jobs in a reentrant flow shop. Gupta and Sivakumar [9] provide a technique based on a simulation technique. Miragliotta and Perona [21] provide a decentralized and multi-objective scheduling heuristic in which the different machines interact with each other to minimize the work in progress.…”
Section: Contextmentioning
confidence: 99%
“…They also mentioned the standard deviation of C max and the minimization of the sum of the completion time of jobs in a reentrant flow shop. Gupta and Sivakumar [9] provide a technique based on a simulation technique. Miragliotta and Perona [21] provide a decentralized and multi-objective scheduling heuristic in which the different machines interact with each other to minimize the work in progress.…”
Section: Contextmentioning
confidence: 99%
“…Dugardin et al developed a multiobjective method [17] to solve a reentrant hybrid flow shop problem which involves total tardiness. [50] min Cmax global heuristic -Gupta and Sivakumar [25] 3 different heuristic and simulation -Miragliotta and Perona [37] min W.I.P.…”
Section: Context In Reentrant Schedulingmentioning
confidence: 99%
“…As in simulation, we go ahead along the simulated time to process different events, same we do in CSS, going ahead along the simulated time and scheduling jobs on the machine. In recent developments, this has become a popular technique for developing production schedules and dispatch lists in manufacturing environments [17]. Here, for batch scheduling, the look-ahead batching is applied at each scheduling decision instant in the simulated time, i.e.…”
Section: Look-ahead Batching Algorithmmentioning
confidence: 99%
“…Here, we use conjunctive simulated scheduling (CSS) approach [17] for scheduling the jobs on the batch processing machine. In CSS, the benefits of discrete event simulation are enjoined with the scheduling efforts.…”
Section: Look-ahead Batching Algorithmmentioning
confidence: 99%