Two-Machine and Two-Agent Flow Shop with Special Processing Times Structures
From MaRDI portal
Publication:5359060
DOI10.1142/S0217595917500178zbMath1377.90029OpenAlexW2724791337MaRDI QIDQ5359060
Byung-Gyoo Kim, Byung-Cheon Choi, Myoung-Ju Park
Publication date: 22 September 2017
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595917500178
Related Items (2)
Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem ⋮ Two-Machine Ordered Flow Shop Scheduling with Generalized Due Dates
Cites Work
- Unnamed Item
- Two-agent scheduling in a flowshop
- Single machine batch scheduling with two competing agents to minimize total flowtime
- Two-agent scheduling to minimize the total cost
- Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties
- Single-machine scheduling with two competing agents and learning consideration
- Two-agent single-machine scheduling problems under increasing linear deterioration
- A two-machine flowshop problem with two agents
- A note on the scheduling with two families of jobs
- Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
- Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
- Two-agent parallel machine scheduling with a restricted number of overlapped reserved tasks
- Approximation schemes for two-machine flow shop scheduling with two agents
- Two-agent single-machine scheduling with assignable due dates
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
- 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
- A Batch Scheduling Problem with Two Agents
- Competitive Two-Agent Scheduling and Its Applications
- A competitive scheduling problem and its relevance to UMTS channel assignment
- Faster algorithms for the shortest path problem
- Scheduling Problems with Two Competing Agents
- Rescheduling for New Orders
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- CON/SLK due date assignment and scheduling on a single machine with two agents
- Multiagent Scheduling
- Single Machine Two-Agent Scheduling with Deteriorating Jobs
- An Ordered Flow Shop with Two Agents
This page was built for publication: Two-Machine and Two-Agent Flow Shop with Special Processing Times Structures
