Resolution for bounded-splitting jobs scheduling problem on a single machine in available time-windows.
Trang Hong SonTran Van LangNguyen Huynh TuongAmeur SoukhalPublished in: J. Ambient Intell. Humaniz. Comput. (2021)
Keyphrases
- single machine
- scheduling problem
- processing times
- total tardiness
- earliness tardiness
- release times
- flowshop
- release dates
- maximum lateness
- total weighted tardiness
- minimize total
- setup times
- sequence dependent setup times
- weighted tardiness
- scheduling jobs
- weighted number of tardy jobs
- precedence constraints
- minimizing makespan
- identical parallel machines
- parallel machines
- high multiplicity
- number of late jobs
- single machine scheduling problem
- identical machines
- np hard
- completion times
- job processing times
- vehicle routing problem
- dominance rules
- vehicle routing
- tabu search
- strongly np hard
- competitive ratio
- dispatching rule
- learning effect
- deteriorating jobs
- dynamic programming
- production scheduling
- job shop
- traveling salesman problem
- job shop scheduling problem
- polynomially solvable