A new heuristic algorithm for the machine scheduling problem with job delivery coordination.
Chi-Shiang SuJason Chao-Hsien PanTsung-Shin HsuPublished in: Theor. Comput. Sci. (2009)
Keyphrases
- flowshop
- scheduling problem
- parallel machine scheduling problem
- processing times
- minimizing total tardiness
- maximum lateness
- minimizing makespan
- single machine
- asymptotic optimality
- sequence dependent setup times
- special case
- setup times
- tabu search
- completion times
- np hard
- bicriteria
- identical machines
- scheduling decisions
- parallel machines
- precedence constraints
- cooperative
- job processing times
- total weighted tardiness
- multi agent systems
- unrelated parallel machines
- release dates
- strongly np hard
- multi agent
- shortest processing time
- permutation flowshop
- identical parallel machines
- preventive maintenance
- job shop
- batch processing
- scheduling jobs
- multiple agents
- tardiness penalties
- dispatching rule
- upper bound
- objective function
- distributed agents
- limited capacity
- job shop scheduling problem
- information sharing
- multiagent systems