The one machine scheduling problem: Insertion of a job under the real-time constraint.
Cyril DuronMohamed Aly Ould LoulyJean-Marie ProthPublished in: Eur. J. Oper. Res. (2009)
Keyphrases
- flowshop
- scheduling problem
- real time
- minimizing total tardiness
- parallel machine scheduling problem
- processing times
- bicriteria
- setup times
- single machine
- maximum lateness
- sequence dependent setup times
- minimizing makespan
- asymptotic optimality
- completion times
- parallel machines
- tabu search
- identical machines
- special case
- job processing times
- tardiness penalties
- unrelated parallel machines
- release dates
- batch processing
- np hard
- job shop
- scheduling decisions
- strongly np hard
- limited capacity
- data structure
- total weighted tardiness
- precedence constraints
- identical parallel machines
- job shop scheduling problem
- vision system
- scheduling jobs
- genetic algorithm
- low cost
- high speed
- preventive maintenance