Scheduling with or without precedence relations on a serial-batch machine to minimize makespan and maximum cost
From MaRDI portal
Publication:2333219
DOI10.1016/j.amc.2018.03.001zbMath1427.90141OpenAlexW2794569776WikidataQ130052239 ScholiaQ130052239MaRDI QIDQ2333219
Junling Yuan, Zhichao Geng, Jinjiang Yuan
Publication date: 12 November 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2018.03.001
Related Items (6)
When serial batch scheduling involves parallel batching decisions: a branch and price scheme ⋮ Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work ⋮ Serial-batching scheduling with two agents to minimize makespan and maximum cost ⋮ Improved algorithms for two-agent scheduling on an unbounded serial-batching machine ⋮ Approximation algorithms for minimizing the maximum lateness and makespan on parallel machines ⋮ Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bicriteria scheduling on a series-batching machine to minimize maximum cost and makespan
- The third comprehensive survey on scheduling problems with setup times/costs
- NP-complete scheduling problems
- A note on the single machine serial batching scheduling problem to minimize maximum lateness with precedence constraints
- Bounded serial-batching scheduling for minimizing maximum lateness and makespan
- A survey of scheduling problems with setup times or costs
- Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness
- Multicriteria scheduling
- Multicriteria scheduling problems: a survey
- An Improved Algorithm for a Bicriteria Batching Scheduling Problem
- Scheduling Tasks with Nonuniform Deadlines on Two Processors
- Scheduling Groups of Jobs on a Single Machine
This page was built for publication: Scheduling with or without precedence relations on a serial-batch machine to minimize makespan and maximum cost
