Parallel machines scheduling with machine preference via agent-based approach
From MaRDI portal
Publication:272606
DOI10.1016/j.amc.2014.01.107zbMath1334.90052OpenAlexW2042287397MaRDI QIDQ272606
Publication date: 20 April 2016
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2014.01.107
Uses Software
Cites Work
- Unnamed Item
- Parallel machine scheduling with a deteriorating maintenance activity and total absolute differences penalties
- Comments on ``A note on minimizing maximum lateness in an \(m\)-machine scheduling problem with a learning effect
- Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach
- A state-of-the-art review of parallel-machine scheduling research
- A note on minimizing maximum lateness in an \(m\)-machine scheduling problem with a learning effect
- Tabu search for total tardiness minimization in flowshop scheduling problems
- Heuristic methods for the identical parallel machine flowtime problem with set-up times
- A survey of scheduling problems with setup times or costs
- A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines
- Parallel machine scheduling with preference of machines
- Agent-based scheduling in production systems
- Unknown Input Observers Designed by Eigenstructure Assignment
- Integration of process planning and scheduling by exploring the flexibility of process planning
- Integrated process planning and scheduling/rescheduling—an agent-based approach
- An agent-based negotiation approach to integrate process planning and scheduling
This page was built for publication: Parallel machines scheduling with machine preference via agent-based approach
