Academic Journal

Scheduling a batch processing machine with incompatible job families.

Λεπτομέρειες βιβλιογραφικής εγγραφής
Τίτλος: Scheduling a batch processing machine with incompatible job families.
Συγγραφείς: Azizoglu, Meral, Webster, Scott
Πηγή: Computers & Industrial Engineering. Apr2001, Vol. 39 Issue 3/4, p325. 11p. 7 Charts.
Θεματικοί όροι: *Production scheduling, Batch processing in electronic data processing
Περίληψη: Investigates on the problem of scheduling batch processors in some industries with incompatible job families. Importance of batch processor model; Insights of different models; Optimal solutions from B and B algorithm.
Βάση Δεδομένων: Business Source Index
Περιγραφή
ISSN:03608352
DOI:10.1016/S0360-8352(01)00009-2