Two-machine and two-agent flow shop with special processing times structures
From MaRDI portal
Publication:5359060
DOI10.1142/S0217595917500178zbMATH Open1377.90029OpenAlexW2724791337MaRDI QIDQ5359060FDOQ5359060
Authors: 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
Recommendations
Cites Work
- Title not available (Why is that?)
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- 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
- Competitive two-agent scheduling and its applications
- Scheduling Problems with Two Competing Agents
- Single machine batch scheduling with two competing agents to minimize total flowtime
- Multiagent scheduling. Models and algorithms
- A note on the scheduling with two families of jobs
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
- Faster algorithms for the shortest path problem
- Single-machine scheduling with two competing agents and learning consideration
- Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
- A competitive scheduling problem and its relevance to UMTS channel assignment
- Two-agent scheduling in a flowshop
- Rescheduling for New Orders
- Two-agent scheduling to minimize the total cost
- A two-machine flowshop problem with two agents
- Two-agent single-machine scheduling with assignable due dates
- Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties
- Two-agent single-machine scheduling problems under increasing linear deterioration
- Approximation schemes for two-machine flow shop scheduling with two agents
- Single machine two-agent scheduling with deteriorating jobs
- A batch scheduling problem with two agents
- \(CON/SLK\) due date assignment and scheduling on a single machine with two agents
- Two-agent parallel machine scheduling with a restricted number of overlapped reserved tasks
- An ordered flow shop with two agents
Cited In (7)
- An ordered flow shop with two agents
- The two-machine permutation flow shop with state-dependent processing times
- Two-agent scheduling in a flowshop
- Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem
- Two-agent scheduling in a two-machine open shop
- A two-machine no-wait flow shop problem with two competing agents
- Two-machine ordered flow shop scheduling with generalized due dates
This page was built for publication: Two-machine and two-agent flow shop with special processing times structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5359060)
