Paper Info
Title
Bicriterion scheduling with a negotiable common due window and resource-dependent processing times.
Abstract
•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 approximately solve P4
Year
DOI
Venue
2019
10.1016/j.ins.2018.11.023
Information Sciences
Keywords
Field
DocType
Scheduling,Common due window assignment,Resource-dependent processing times,Pareto-optimal point
Resource consumption,Discrete mathematics,Mathematical optimization,Scheduling (computing),Integer programming,Mathematics,Pareto principle,Binary number
Journal
Volume
ISSN
Citations 
478
0020-0255
0
PageRank 
References 
Authors
0.34
26
2
Name
Order
Citations
PageRank
Dujuan Wang19114.07
Zhi Wu Li247038.43