Mixed binary integer programming formulations for the flow shop scheduling problems. A case study: ISD projects scheduling.
Mohsen ZiaeeSeyed Jafar SadjadiPublished in: Appl. Math. Comput. (2007)
Keyphrases
- scheduling problem
- flowshop
- integer programming formulations
- case study
- single machine
- precedence constraints
- setup times
- processing times
- job shop
- np hard
- flowshop scheduling
- integer programming
- unrelated parallel machines
- sequence dependent setup times
- linear program
- maximum lateness
- parallel machines
- tabu search
- job shop scheduling
- preventive maintenance
- total tardiness
- bicriteria
- minimizing makespan
- lower bound
- release dates
- job shop scheduling problem
- list scheduling
- permutation flowshop
- flowshop scheduling problems
- makespan minimization
- information systems development
- total weighted tardiness
- software development
- dispatching rule
- asymptotic optimality
- open shop
- completion times
- search algorithm
- linear programming
- genetic algorithm