Flow‐shop batch scheduling with identical processing‐time jobs | Zendy

Mosheiov Gur | Zendy; Oron Daniel | Zendy; Ritov Yaacov | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

Flow‐shop batch scheduling with identical processing‐time jobs

Author(s) -

Mosheiov Gur,

Oron Daniel,

Ritov Yaacov

Publication year - 2004

Publication title -

naval research logistics (nrl)

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.665

H-Index - 68

eISSN - 1520-6750

pISSN - 0894-069X

DOI - 10.1002/nav.20028

Subject(s) - computer science , flow shop scheduling , scheduling (production processes) , schedule , due date , batch production , operations research , batch processing , mathematical optimization , job shop scheduling , operations management , mathematics , engineering , operating system

In many practical situations of production scheduling, it is either necessary or recommended to group a large number of jobs into a relatively small number of batches. A decision needs to be made regarding both the batching (i.e., determining the number and the size of the batches) and the sequencing (of batches and of jobs within batches). A setup cost is incurred whenever a batch begins processing on a given machine. This paper focuses on batch scheduling of identical processing‐time jobs, and machine‐ and sequence‐independent setup times on an m ‐machine flow‐shop. The objective is to find an allocation to batches and their schedule in order to minimize flow‐time. We introduce a surprising and nonintuitive solution for the problem. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research