Scheduling Problems to Maximize the Weighted Number of JIT Jobs

Yunqiang Yin, Dujuan Wang, T. C.E. Cheng

Research output: Chapter in book / Conference proceedingChapter in an edited book (as author)Academic researchpeer-review

Abstract

This chapter is devoted to scheduling problems with the objective of maximizing the weighted number of JIT jobs in flowshop and unrelated parallel-machine settings, which is equivalent to minimize the weighted number of jobs that are early or tardy. This part is composed of four sections. In Sect. 6.1, we present the results concerning the problems in the two-machine flowshop setting. In Sect. 6.2, we present the results concerning the problems in the unrelated parallel-machine setting. In Sect. 6.3, we provide the summary and tables. We end the chapter in Sect. 6.4 with bibliographic remarks.

Original languageEnglish
Title of host publicationUncertainty and Operations Research
PublisherSpringer Nature
Pages143-180
Number of pages38
DOIs
Publication statusPublished - 2020

Publication series

NameUncertainty and Operations Research
ISSN (Print)2195-996X
ISSN (Electronic)2195-9978

ASJC Scopus subject areas

  • General Decision Sciences

Fingerprint

Dive into the research topics of 'Scheduling Problems to Maximize the Weighted Number of JIT Jobs'. Together they form a unique fingerprint.

Cite this