Single-machine preemptive scheduling with release dates involving the total weighted late work criterion
From MaRDI portal
Publication:6093999
DOI10.1007/s40305-022-00403-xMaRDI QIDQ6093999
Publication date: 12 September 2023
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-022-00403-x
90C29: Multi-objective and goal programming
90B35: Deterministic scheduling theory in operations research
Cites Work
- Unnamed Item
- Unnamed Item
- Minimizing mean weighted execution time loss on identical and uniform processors
- Minimizing the number of tardy job units under release time constraints
- Minimizing the weighted number of tardy task units
- Open shop scheduling problems with late work criteria.
- A two-agent single-machine scheduling problem with late work criteria
- Scheduling on parallel identical machines with late work criterion: offline and online cases
- Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
- Single-machine scheduling with multi-agents to minimize total weighted late work
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
- Two-agent single-machine scheduling with release dates and preemption to minimize the maximum lateness
- Two-agent scheduling problems on a single-machine to minimize the total weighted late work
- A note on a two-agent scheduling problem related to the total weighted late work
- A multiple-criterion model for machine scheduling
- Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness
- Scheduling Problems with Two Competing Agents
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work
- A Branch-and-Bound Algorithm for Two-Agent Scheduling with Learning Effect and Late Work Criterion
- Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria
- Single‐machine scheduling with deadlines to minimize the total weighted late work
- Multiagent Scheduling
