2005
DOI: 10.1016/j.cor.2004.04.001
|View full text |Cite
|
Sign up to set email alerts
|

Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
85
0
2

Year Published

2006
2006
2017
2017

Publication Types

Select...
5
5

Relationship

0
10

Authors

Journals

citations
Cited by 178 publications
(87 citation statements)
references
References 23 publications
0
85
0
2
Order By: Relevance
“…According to their DBDH method, all alternative batches of a product type in the selected time-window are composed and prioritized, and wait and start decisions are made accordingly. Mönch, Balasubramanian, Fowler, and Pfund (2005) proposed three different versions of time-window based priority indexing for the problem with different ready times. They also discuss the use of decision theory in prioritizing batches.…”
Section: Batch Control From the Consumer's Perspectivementioning
confidence: 99%
“…According to their DBDH method, all alternative batches of a product type in the selected time-window are composed and prioritized, and wait and start decisions are made accordingly. Mönch, Balasubramanian, Fowler, and Pfund (2005) proposed three different versions of time-window based priority indexing for the problem with different ready times. They also discuss the use of decision theory in prioritizing batches.…”
Section: Batch Control From the Consumer's Perspectivementioning
confidence: 99%
“…Oulamara et al [37] have studied a two processor problem that involved a discrete and batch processor. Mönch et al [32] investigated two different approaches for scheduling jobs with incompatible job families and unequal ready times on parallel batch processors and developed genetic algorithms to minimize the total weighted tardiness criterion.…”
Section: Related Literaturementioning
confidence: 99%
“…Mönch ve diğ. [9], eşit işlem süresine sahip işlerin bir iş ailesi oluşturduğu farklı büyüklükteki ve farklı hazırlık zamanlarına sahip işlerin yığın üretim yapan eş özellikteki birden çok makinede çizelgeleme problemi ile ilgilenmiştir. Amaç, işlere ait gecikmelerin ağırlıklı toplamını (∑ ) en küçüklemektir.…”
Section: Yazın Taramasıunclassified