Shop scheduling problems with pliable jobs.
Sigrid KnustNatalia V. ShakhlevichStefan WaldherrChristian WeißPublished in: J. Sched. (2019)
Keyphrases
- scheduling problem
- processing times
- flowshop
- permutation flowshop
- single machine
- earliness tardiness
- precedence constraints
- setup times
- parallel machines
- identical parallel machines
- unrelated parallel machines
- total tardiness
- parallel machine scheduling problem
- total weighted tardiness
- minimizing makespan
- release dates
- sequence dependent setup times
- maximum lateness
- identical machines
- strongly np hard
- high multiplicity
- limited capacity
- release times
- optimal scheduling
- job shop scheduling problem
- np hard
- weighted tardiness
- tabu search
- minimize total
- single machine scheduling problem
- completion times
- tardiness penalties
- job shop scheduling
- deteriorating jobs
- list scheduling
- special case
- job shop
- randomly generated test problems
- sequencing problems