PARALLEL-MACHINE SCHEDULING IN SHARED MANUFACTURING

Min Ji, Xinna Ye, Fangyao Qian, T. C.E. Cheng, Yiwei Jiang

Research output: Journal article publicationJournal articleAcademic researchpeer-review

1 Citation (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)881-891
Number of pages11
JournalJournal of Industrial and Management Optimization
Volume18
Issue number1
DOIs
Publication statusPublished - Jan 2022

Keywords

  • FPTAS
  • parallel machines
  • processing set
  • Scheduling
  • shared manufacturing

ASJC Scopus subject areas

  • Business and International Management
  • Strategy and Management
  • Control and Optimization
  • Applied Mathematics

Cite this