Open AccessParallel-machine scheduling in shared manufacturing
Author(s) -
Min Ji,
Xinna Ye,
Fangyao Qian,
T. C. E. Cheng,
Yiwei Jiang
Publication year - 2022
Publication title -
journal of industrial and management optimization
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.325
H-Index - 32
eISSN - 1553-166X
pISSN - 1547-5816
DOI - 10.3934/jimo.2020174
Subject(s) - computer science , job shop scheduling , scheduling (production processes) , parallel computing , distributed computing , mathematical optimization , mathematics , operating system , schedule
We consider parallel-machine scheduling in the context of shared manufacturing where each job has a machine set to which it can be assigned for processing. Such a set is called the processing set. In the shared manufacturing setting, a job can be assigned not only to certain machines for processing, but can also be processed on the remaining machines at a certain cost. Compared with traditional scheduling with job rejection, the scheduling model under study embraces the notion of sustainable manufacturing. Showing that the problem is NP -hard, we develop a fully polynomial-time approximation scheme to solve the problem when the number of machines is fixed.