Minmax scheduling with acceptable lead-times: Extensions to position-dependent processing times, due-window and job rejection.
Enrique GerstlBaruch MorGur MosheiovPublished in: Comput. Oper. Res. (2017)
Keyphrases
- processing times
- lead time
- scheduling problem
- identical machines
- identical parallel machines
- scheduling jobs
- release dates
- tardiness cost
- single machine
- supply chain
- flowshop
- number of tardy jobs
- independent and identically distributed
- release times
- scheduling decisions
- setup times
- total weighted tardiness
- holding cost
- single machine scheduling problem
- job processing times
- single item
- service level
- worst case performance ratio
- completion times
- lot sizing
- sequence dependent setup times
- precedence constraints
- total cost
- parallel machines
- inventory level
- job shop
- resource consumption
- setup cost
- random variables
- tabu search
- np hard
- computational complexity
- infinite horizon
- planning horizon
- job shop scheduling problem
- search algorithm