A multi-agent system for the weighted earliness tardiness parallel machine problem
From MaRDI portal
Publication:2257353
DOI10.1016/j.cor.2013.10.013zbMath1307.90074OpenAlexW2044872085MaRDI QIDQ2257353
Sergey Polyakovskiy, Rym M'Hallah
Publication date: 25 February 2015
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2013.10.013
Related Items
Design of automated negotiation mechanisms for decentralized heterogeneous machine scheduling, Scheduling with competing agents, total late work and job rejection, An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach, A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
Cites Work
- Unnamed Item
- An improved earliness--tardiness timing algorithm
- Parallel machine earliness/tardiness scheduling problem under the effects of position based learning and linear/nonlinear deterioration
- An agent-based approach to the two-dimensional guillotine bin packing problem
- Equivalence of mean flow time problems and mean absolute deviation problems
- On the general solution for a class of early/tardy problems
- Multiple-machine scheduling with earliness, tardiness and completion time penalties
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs
- Scheduling job classes on uniform machines
- Solving a two-agent single-machine scheduling problem considering learning effect
- Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey
- Parallel machine earliness and tardiness scheduling with proportional weights
- Exponential neighborhood search for a parallel machine scheduling problem
- Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates
- Due-date assignment on uniform machines
- A moving block heuristic to minimise earliness and tardiness costs on parallel machines
- Scheduling Problems with Two Competing Agents
- Heuristics for Multimachine Scheduling Problems with Earliness and Tardiness Costs
- Single Stage Minimum Absolute Lateness Problem with a Common Due Date on Non-Identical Machines
- Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties
