The following pages link to Multicriteria scheduling (Q2566699):
Displaying 50 items.
- Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints (Q1751234) (← links)
- Scheduling with time-of-use costs (Q1755384) (← links)
- Minimizing the number of late jobs when the start time of the machine is variable (Q1758276) (← links)
- Bi-objective scheduling on a restricted batching machine (Q1782176) (← links)
- A note on competing-agent Pareto-scheduling (Q1996756) (← links)
- Branch-and-bound algorithms for minimizing total earliness and tardiness in a two-machine permutation flow shop with unforced idle allowed (Q2003555) (← links)
- Single machine batch scheduling with two non-disjoint agents and splitable jobs (Q2023129) (← links)
- Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion (Q2030503) (← links)
- Bi-objective parallel machine scheduling with additional resources during setups (Q2030593) (← links)
- Unbounded serial-batching scheduling on hierarchical optimization (Q2059199) (← links)
- Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost (Q2081468) (← links)
- Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time (Q2098029) (← links)
- Pareto-scheduling of two competing agents with their own equal processing times (Q2140187) (← links)
- Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times (Q2140270) (← links)
- Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost (Q2144217) (← links)
- Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan (Q2172079) (← links)
- Schedule-allocate and robust sequencing in three-machine robotic cell under breakdowns (Q2214792) (← links)
- Single-machine scheduling with maintenance activities and rejection (Q2218650) (← links)
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems (Q2256205) (← links)
- Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling (Q2275933) (← links)
- An approximation scheme for the bi-scenario sum of completion times trade-off problem (Q2283294) (← links)
- ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost (Q2284315) (← links)
- Machine scheduling in production: a content analysis (Q2294174) (← links)
- Parallel machine makespan minimization subject to machine availability and total completion time constraints (Q2304115) (← links)
- Bicriteria scheduling of equal length jobs on uniform parallel machines (Q2307491) (← links)
- Scheduling with release dates and preemption to minimize multiple max-form objective functions (Q2327626) (← links)
- Scheduling with or without precedence relations on a serial-batch machine to minimize makespan and maximum cost (Q2333219) (← links)
- Bi-objective single machine scheduling problem with stochastic processing times (Q2343079) (← links)
- Minimizing the weighted number of tardy jobs on multiple machines: a review (Q2358307) (← links)
- Optimal allocation and processing time decisions on non-identical parallel CNC machines: \(\epsilon\)-constraint approach (Q2371348) (← links)
- A survey of scheduling with controllable processing times (Q2381529) (← links)
- Two-agent scheduling of time-dependent jobs (Q2410089) (← links)
- Single-machine multi-agent scheduling problems with a global objective function (Q2434286) (← links)
- Pareto optimization of rescheduling with release dates to minimize makespan and total sequence disruption (Q2434315) (← links)
- Minimizing setup costs for parallel multi-purpose machines under load-balancing constraint (Q2467258) (← links)
- Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates (Q2482802) (← links)
- Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness (Q2514124) (← links)
- Bicriteria hierarchical optimization of two-machine flow shop scheduling problem with time-dependent deteriorating jobs (Q2514766) (← links)
- Scheduling jobs with controllable processing time, truncated job-dependent learning and deterioration effects (Q2628200) (← links)
- A survey on scheduling problems with due windows (Q2630089) (← links)
- Complexity of two dual criteria scheduling problems (Q2643797) (← links)
- Solving a stochastic single machine problem with initial idle time and quadratic objective (Q2655649) (← links)
- Stochastic optimization approaches for elective surgery scheduling with downstream capacity constraints: models, challenges, and opportunities (Q2669630) (← links)
- Bicriteria scheduling on an unbounded parallel-batch machine for minimizing makespan and maximum cost (Q2680241) (← links)
- Pareto optimal algorithms for minimizing total (weighted) completion time and maximum cost on a single machine (Q2686863) (← links)
- Faster algorithms for bicriteria scheduling of identical jobs on uniform machines (Q2691455) (← links)
- Multicriteria scheduling problems: a survey (Q2773166) (← links)
- An exact method for the bi-objective one-machine problem with maximum lateness and unit family setup cost objectives (Q2861560) (← links)
- BATCHING MACHINE SCHEDULING WITH BICRITERIA: MAXIMUM COST AND MAKESPAN (Q2931723) (← links)
- Bicriteria robotic cell scheduling with controllable processing times (Q2997880) (← links)
