Scheduling with release dates and preemption to minimize multiple max-form objective functions
From MaRDI portal
Publication:2327626
DOI10.1016/j.ejor.2019.07.072zbMath1430.90296OpenAlexW2966669549WikidataQ127392931 ScholiaQ127392931MaRDI QIDQ2327626
Publication date: 15 October 2019
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2019.07.072
Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35)
Related Items (13)
Pareto-scheduling of two competing agents with their own equal processing times ⋮ Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost ⋮ Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work ⋮ Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work ⋮ Competitive two-agent scheduling with release dates and preemption on a single machine ⋮ Single-machine scheduling with multi-agents to minimize total weighted late work ⋮ Single-machine scheduling of multiple projects with controllable processing times ⋮ Online NDP-constraint scheduling of jobs with delivery times or weights ⋮ Unary NP-hardness of preemptive scheduling to minimize total completion time with release times and deadlines ⋮ Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion ⋮ ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost ⋮ Single-machine online scheduling of jobs with non-delayed processing constraint ⋮ Min–Max Scheduling of Batch or Drop-Line Jobs Under Agreeable Release and Processing Times
Cites Work
- Unnamed Item
- Unnamed Item
- Single machine scheduling with two competing agents and equal job processing times
- A note on the scheduling with two families of jobs
- Preemptive scheduling with two minimax criteria
- Complexities of four problems on two-agent scheduling
- Complexity analyses for multi-agent scheduling problems with a global agent and equal length jobs
- Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints
- Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
- 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
- Two-agent single-machine scheduling with release dates and preemption to minimize the maximum lateness
- A note on the complexity of the problem of two-agent scheduling on a single machine
- Two-agent scheduling of time-dependent jobs
- Multi-agent scheduling on a single machine with a fixed number of competing agents to minimize the weighted sum of number of tardy jobs and makespans
- A multiple-criterion model for machine scheduling
- Multi-agent scheduling on a single machine with max-form criteria
- Multi-agent single machine scheduling
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Multicriteria scheduling
- Competitive Two-Agent Scheduling and Its Applications
- Scheduling Problems with Two Competing Agents
- Scheduling with Multiple Performance Measures: The One-Machine Case
- Two‐agent scheduling on a single sequential and compatible batching machine
- Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria
- Multiagent Scheduling
- Solving multi-agent scheduling problems on parallel machines with a global objective function
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
This page was built for publication: Scheduling with release dates and preemption to minimize multiple max-form objective functions
