A single-machine bi-criterion scheduling problem with two agents
From MaRDI portal
Publication:482429
DOI10.1016/j.amc.2013.05.025zbMath1302.90086OpenAlexW1967655446MaRDI QIDQ482429
Yu-Hsiang Chung, Wen-Chiung Lee, Zong-Ren Huang
Publication date: 30 December 2014
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2013.05.025
Related Items (2)
A survey of due-date related single-machine with two-agent scheduling problem ⋮ Algorithms for a two‐machine flowshop problem with jobs of two classes
Cites Work
- Unnamed Item
- Optimization by Simulated Annealing
- Permutation flow shop scheduling with order acceptance and weighted tardiness
- The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect
- A particle swarm algorithm for inspection optimization in serial multi-stage processes
- Group scheduling with deteriorating jobs to minimize the total weighted number of late jobs
- Two-agent scheduling with position-based deteriorating jobs and learning effects
- The role of crossover operator in the genetic optimization of magnetic models
- Parallel machine scheduling with a deteriorating maintenance activity and total absolute differences penalties
- Using genetic algorithms for the coordinated scheduling problem of a batching machine and two-stage transportation
- Scheduling open shops with parallel machines to minimize total completion time
- A single-machine scheduling problem with two-agent and deteriorating jobs
- Particle swarm optimization: Hybridization perspectives and experimental illustrations
- A note on the scheduling with two families of jobs
- Scheduling two agents with controllable processing times
- Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
- Scheduling interfering job sets on parallel machines
- Heterogeneous-criteria scheduling: Minimizing weighted number of tardy jobs and weighted completion time
- A Lagrangian approach to single-machine scheduling problems with two competing agents
- A note on the complexity of the problem of two-agent scheduling on a single machine
- A multiple-criterion model for machine scheduling
- Multi-agent scheduling on a single machine with max-form criteria
- Multi-agent single machine scheduling
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Competitive Two-Agent Scheduling and Its Applications
- Planning Machine Maintenance in Two-Machine Shop Scheduling
- Scheduling Problems with Two Competing Agents
This page was built for publication: A single-machine bi-criterion scheduling problem with two agents
