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...
Saved in:
Published in | Information sciences Vol. 478; pp. 258 - 274 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
Elsevier Inc
01.04.2019
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!