Shop‐scheduling problems with fixed and non‐fixedmachine orders of the jobs.
Natalia V. ShakhlevichYuri N. SotskovFrank WernerPublished in: Ann. Oper. Res. (1999)
Keyphrases
- scheduling problem
- processing times
- flowshop
- tardiness penalties
- single machine
- setup times
- earliness tardiness
- total tardiness
- sequence dependent setup times
- permutation flowshop
- precedence constraints
- parallel machines
- release dates
- unrelated parallel machines
- minimizing makespan
- parallel machine scheduling problem
- identical parallel machines
- limited capacity
- total weighted tardiness
- job shop scheduling
- maximum lateness
- optimal scheduling
- identical machines
- minimize total
- np hard
- job shop
- strongly np hard
- single machine scheduling problem
- list scheduling
- completion times
- tabu search
- randomly generated test problems
- fixed number
- special case
- deteriorating jobs
- release times
- job shop scheduling problem
- greedy heuristics
- evolutionary algorithm
- optimal solution
- genetic algorithm