z-logo
open-access-imgOpen Access
Polynomial time algorithm for minmax scheduling with common due-window and proportional-linear shortening processing times
Author(s) -
Xue Jia,
Jing Xue,
Shiyun Wang,
JiBo Wang
Publication year - 2022
Publication title -
mathematical biosciences and engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.451
H-Index - 45
eISSN - 1551-0018
pISSN - 1547-1063
DOI - 10.3934/mbe.2022414
Subject(s) - tardiness , minimax , time complexity , scheduling (production processes) , mathematical optimization , algorithm , due date , window (computing) , mathematics , computer science , schedule , job shop scheduling , operating system

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom