A just-in-time scheduling problem with two competing agents
From MaRDI portal
Publication:2228372
DOI10.1007/S11590-019-01494-XzbMATH Open1460.90086OpenAlexW2980763366WikidataQ127022766 ScholiaQ127022766MaRDI QIDQ2228372FDOQ2228372
Authors: Byung-Cheon Choi, Jibok Chung, Myoung-Ju Park 
Publication date: 17 February 2021
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-019-01494-x
Recommendations
- Single machine just‐in‐time scheduling problems with two competing agents
- Two-agent single-machine scheduling problem with just-in-time jobs
- Scheduling Problems with Two Competing Agents
- Competitive two-agent scheduling and its applications
- Competitive two-agent scheduling with release dates and preemption on a single machine
Cites Work
- Approximation Schemes for the Restricted Shortest Path Problem
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- 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
- Two-agent single-machine scheduling problem with just-in-time jobs
- Single machine just‐in‐time scheduling problems with two competing agents
- Single-machine scheduling with two competing agents and learning consideration
- Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
- Two-agent scheduling to minimize the total cost
- 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
- Single machine scheduling to minimize the number of early and tardy jobs
- Title not available (Why is that?)
- A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines
- Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs
- Maximizing the weighted number of just-in-time jobs in flow shop scheduling
- Maximizing weighted number of just-in-time jobs on unrelated parallel machines
- Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs
- 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
Cited In (7)
- Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work
- Scheduling two competing agents when one agent has significantly fewer jobs
- Single machine just‐in‐time scheduling problems with two competing agents
- Competitive two-agent scheduling and its applications
- A batch scheduling problem with two agents
- Scheduling Problems with Two Competing Agents
- Two-agent single-machine scheduling problem with just-in-time jobs
This page was built for publication: A just-in-time scheduling problem with two competing agents
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2228372)
