Single-machine batch scheduling of linear deteriorating jobs

Ji, Min; Yang, Qinyun; Yao, Danli; Cheng, T.C.E.

doi:10.1016/j.tcs.2015.02.025

Search citation statements

Order By: Relevance

Paper Sections

Select...

Procedures Partition(a E δ)1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2017

2022

Publication Types

Select...

Article6

Relationship

Self Cite1

Independent5

Authors

Journals

Cited by 7 publications

(1 citation statement)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We present two main properties of Partition that we will use in the development of our FPTAS A ε . Kovalyov and Kubiak [24,25] first provided the properties, which Ji and Cheng [18,19], and Ji et al [20,21] extended subsequently. We provide a formal description of the FPTAS A ε for problem P m |M j , SM | C max + S as follows:…”

Section: Procedures Partition(a E δ)mentioning

confidence: 99%

Parallel-machine scheduling in shared manufacturing

Ji¹,

Ye²,

Qian³

et al. 2022

JIMO

Self Cite

View full text Add to dashboard Cite

<p style='text-indent:20px;'>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 <i>NP</i>-hard, we develop a fully polynomial-time approximation scheme to solve the problem when the number of machines is fixed.</p>

show abstract