Due-window assignment scheduling with past-sequence-dependent setup times
This article investigates the due-window assignment scheduling problem with setup times on a single machine, where setup times of jobs are past-sequence-dependent. Under common, slack and unrestricted due-window assignment methods, the goal is to determine the optimal job sequence and due-window suc...
Saved in:
Published in | Mathematical biosciences and engineering : MBE Vol. 19; no. 3; pp. 3110 - 3126 |
---|---|
Main Authors | , , , |
Format | Journal Article |
Language | English |
Published |
United States
AIMS Press
01.01.2022
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!