Minimizing the Total Weighted Duration of Courses in a Single Machine Problem with Precedence Constraints.
Elena G. MusatovaAlexander A. LazarevPublished in: Autom. Remote. Control. (2023)
Keyphrases
- completion times
- single machine
- precedence constraints
- scheduling problem
- maximum lateness
- single machine scheduling problem
- release dates
- release times
- processing times
- sequence dependent setup times
- weighted number of tardy jobs
- flowshop
- total weighted tardiness
- setup times
- total tardiness
- tabu search
- scheduling jobs
- number of late jobs
- parallel machines
- learning effect
- np hard
- branch and bound algorithm
- identical machines
- job shop scheduling problem
- approximation algorithms
- polynomially solvable
- dynamic programming
- special case