Exact and heuristic procedures for the Heijunka-flow shop scheduling problem with minimum makespan and job replicas.
Joaquín Bautista ValhondoPublished in: Prog. Artif. Intell. (2021)
Keyphrases
- scheduling jobs
- maximum tardiness
- weighted sum
- single machine scheduling problem
- processing times
- flowshop
- single machine
- scheduling problem
- lot streaming
- worst case performance ratio
- batch processing
- minimizing makespan
- parallel machine scheduling problem
- asymptotic optimality
- release dates
- production system
- optimal solution
- tabu search
- setup times
- branch and bound algorithm
- fault tolerant
- load balancing
- deteriorating jobs
- strongly np hard
- search procedures
- parallel machines
- bicriteria
- sequence dependent setup times
- maximum lateness
- multistage
- job shop
- search procedure
- batch processing machines
- search heuristics
- objective function
- asymptotically optimal
- simulated annealing
- upper bound
- lower bound