The following pages link to (Q2734595):
Displaying 50 items.
- Hierarchical optimization with double due dates on an unbounded parallel-batching machine to minimize maximum lateness (Q295879) (← links)
- Bicriteria scheduling on a series-batching machine to minimize maximum cost and makespan (Q300969) (← links)
- Single-machine scheduling with precedence constraints and position-dependent processing times (Q350351) (← links)
- The inverse parallel machine scheduling problem with minimum total completion time (Q380601) (← links)
- Comments on ``Design and performance evaluation of load distribution strategies for multiple loads on heterogeneous linear daisy chain networks'' (Q436840) (← links)
- Single machine bicriteria scheduling with equal-length jobs to minimize total weighted completion time and maximum cost (Q457296) (← links)
- Two-directional traffic scheduling problem solution for a single-track railway with siding (Q517332) (← links)
- Due-window assignment and scheduling with multiple rate-modifying activities under the effects of deterioration and learning (Q541440) (← links)
- Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan (Q541691) (← links)
- The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan (Q596087) (← links)
- Scheduling of coupled tasks with unit processing times (Q600841) (← links)
- Metrics in scheduling problems (Q610604) (← links)
- Finding total unimodularity in optimization problems solved by linear programs (Q627545) (← links)
- Non-clairvoyant scheduling games (Q647492) (← links)
- Scheduling with job-dependent learning effects and multiple rate-modifying activities (Q656606) (← links)
- Scheduling unit length jobs on parallel machines with lookahead information (Q657255) (← links)
- Scheduling and constraint propagation (Q697570) (← links)
- On the open-shop problem with preemption and minimizing the average completion time (Q703917) (← links)
- Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times (Q707000) (← links)
- Preemptive scheduling with simple linear deterioration on a single machine (Q708208) (← links)
- Unrelated parallel-machine scheduling with deterioration effects and deteriorating multi-maintenance activities for minimizing the total completion time (Q727300) (← links)
- Algorithms for solving minimax scheduling problem (Q734231) (← links)
- Models and algorithms of time-dependent scheduling (Q778893) (← links)
- Permutation-induced acyclic networks for the job shop scheduling problem (Q840194) (← links)
- Necessary and sufficient conditions of optimality for some classical scheduling problems (Q852941) (← links)
- Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness (Q856204) (← links)
- Approximability of single machine scheduling with fixed jobs to minimize total completion time (Q857360) (← links)
- Scheduling resource allocation with timeslot penalty for changeover (Q861274) (← links)
- Pre-emptive scheduling problems with controllable processing times (Q880501) (← links)
- Single machine batch scheduling problem with family setup times and release dates to minimize makespan (Q880565) (← links)
- Rescheduling with release dates to minimize makespan under a limit on the maximum sequence disruption (Q881562) (← links)
- Graph models for scheduling systems with machine saturation property (Q883067) (← links)
- Minimizing total completion time for preemptive scheduling with release dates and deadline constraints (Q902745) (← links)
- Note on ``Unrelated parallel-machine scheduling with rate-modifying activities to minimize the total completion time'' (Q903600) (← links)
- The computational complexity analysis of the two-processor flowshop problems with position dependent job processing times (Q905364) (← links)
- A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations (Q958450) (← links)
- The museum visitor routing problem (Q969135) (← links)
- Single machine scheduling with decreasing linear deterioration under precedence constraints (Q980093) (← links)
- A DP algorithm for minimizing makespan and total completion time on a series-batching machine (Q987835) (← links)
- Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan (Q995579) (← links)
- Computational complexity of some scheduling problems with multiprocessor tasks (Q1019301) (← links)
- The one machine scheduling problem: insertion of a job under the real-time constraint (Q1042209) (← links)
- An iterative algorithm for scheduling UET tasks with due dates and release times. (Q1399585) (← links)
- A note on scheduling multiprocessor tasks with identical processing times. (Q1413834) (← links)
- How useful are preemptive schedules? (Q1413904) (← links)
- On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times. (Q1413926) (← links)
- Scheduling the two-way traffic on a single-track railway with a siding (Q1647296) (← links)
- An effective heuristic algorithm for the partial shop scheduling problem (Q1652579) (← links)
- Single machine scheduling with resource allocation and learning effect considering the rate-modifying activity (Q1667833) (← links)
- Bounded serial-batching scheduling for minimizing maximum lateness and makespan (Q1751110) (← links)
