Catalogo Articoli (Spogli Riviste)

OPAC HELP

Titolo:
Scheduling batches with simultaneous job processing for two-machine shop problems
Autore:
Potts, CN; Strusevich, VA; Tautenhahn, T;
Indirizzi:
Univ Southampton, Fac Math Studies, Southampton SO17 1BJ, Hants, England Univ Southampton Southampton Hants England SO17 1BJ 7 1BJ, Hants, England Univ Greenwich, Sch Comp & Math Sci, London SE10 9LS, England Univ Greenwich London England SE10 9LS ath Sci, London SE10 9LS, England Otto Von Guericke Univ, Fak Math, D-39016 Magdeburg, Germany Otto Von Guericke Univ Magdeburg Germany D-39016 9016 Magdeburg, Germany
Titolo Testata:
JOURNAL OF SCHEDULING
fascicolo: 1, volume: 4, anno: 2001,
pagine: 25 - 51
SICI:
1094-6136(200101/02)4:1<25:SBWSJP>2.0.ZU;2-M
Fonte:
ISI
Lingua:
ENG
Soggetto:
TOTAL COMPLETION-TIME; BURN-IN OPERATIONS; FLOW-SHOP; COMPLEXITY; ALGORITHMS; FAMILIES;
Keywords:
scheduling; batching; polynomial algorithm; NP-hard; open shop; job shop; flow shop;
Tipo documento:
Article
Natura:
Periodico
Settore Disciplinare:
Engineering, Computing & Technology
Citazioni:
23
Recensione:
Indirizzi per estratti:
Indirizzo: Potts, CN Univ Southampton, Fac Math Studies, Southampton SO17 1BJ, Hants,England Univ Southampton Southampton Hants England SO17 1BJ ts, England
Citazione:
C.N. Potts et al., "Scheduling batches with simultaneous job processing for two-machine shop problems", J SCHED, 4(1), 2001, pp. 25-51

Abstract

We consider the problem of scheduling independent jobs on two machines in an open shop, a job shop and a flow shop environment. Both machines are batching machines, which means that several operations can be combined into a batch and processed simultaneously on a machine. The batch processing time is the maximum processing time of operations in the batch, and all operations in a batch complete at the same time. Such a situation may occur, for instance, during the final testing stage of circuit board manufacturing, where burn-in operations are performed in ovens. We consider cases in which there is no restriction on the size of a batch on a machine, and in which a machine can process only a bounded number of operations in one batch. For most of the possible combinations of restrictions, we establish the complexitystatus of the problem. Copyright (C) 2001 John Wiley & Sons, Ltd.

ASDD Area Sistemi Dipartimentali e Documentali, Università di Bologna, Catalogo delle riviste ed altri periodici
Documento generato il 22/01/20 alle ore 10:19:57