Bicriterion scheduling with a negotiable common due window and resource-dependent processing times

•A problem with assignable common due window and controllable processing times is studied•Four different models P1-P4 for the problem are investigated•A polynomial time algorithm is developed for P1 and P2-P4 are shown to be NP-hard•DP algorithm and an FPTAS are developed to exactly and approximatel...

Full description

Saved in:
Bibliographic Details
Published inInformation sciences Vol. 478; pp. 258 - 274
Main Authors Wang, Dujuan, Li, Zhiwu
Format Journal Article
LanguageEnglish
Published Elsevier Inc 01.04.2019
Subjects
Online AccessGet full text

Cover

Loading…