Two-agent scheduling on a bounded parallel-batching machine with makespan and maximum lateness objectives
From MaRDI portal
Publication:2176838
DOI10.1007/S40305-019-00258-9zbMath1449.90137OpenAlexW2957809229WikidataQ127495307 ScholiaQ127495307MaRDI QIDQ2176838
Qi Feng, Wei-Ping Shang, Cheng-Wen Jiao, Wen-Jie Li
Publication date: 5 May 2020
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40305-019-00258-9
Related Items (2)
Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan ⋮ Two-agent single-machine scheduling with release dates to minimize the makespan
Cites Work
- Unnamed Item
- Scheduling two job families on a single machine with two competitive agents
- Bicriterion scheduling with equal processing times on a batch processing machine
- Optimal methods for batch processing problem with makespan and maximum lateness objectives
- Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan
- On-line scheduling with delivery time on a single batch machine
- Scheduling a batching machine
- Two-agent parallel-machine scheduling with rejection
- A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives
- A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan
- Complexities of some problems on multi-agent scheduling on a single machine
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
- Two-agent scheduling with rejection on a single machine
- A multiple-criterion model for machine scheduling
- Scheduling Problems with Two Competing Agents
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Multiagent Scheduling
This page was built for publication: Two-agent scheduling on a bounded parallel-batching machine with makespan and maximum lateness objectives
