Minimizing the weighted sum of maximum earliness and maximum tardiness in a single-agent and two-agent form of a two-machine flow shop scheduling problem.
Vahid NasrollahiGhasem MoslehiMohammad Reisi-NafchiPublished in: Oper. Res. (2022)
Keyphrases
- maximum tardiness
- scheduling problem
- single agent
- weighted sum
- multi agent
- multiple agents
- minimizing makespan
- flowshop
- multi agent systems
- dynamic environments
- multi agent coordination
- decision problems
- single machine
- processing times
- path finding
- single machine scheduling problem
- completion times
- np hard
- tabu search
- bicriteria
- precedence constraints
- reinforcement learning
- cooperative
- objective function
- parallel machines
- high quality
- branch and bound algorithm
- utility function
- linear combination
- search algorithm