Pages that link to "Item:Q2361139"
From MaRDI portal
The following pages link to Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan (Q2361139):
Displaying 14 items.
- Minimization of the maximal lateness for a single machine (Q329086) (← links)
- Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time (Q391321) (← links)
- A study of single-machine scheduling problem to maximize throughput (Q398860) (← links)
- Single-machine scheduling with release times and tails (Q596466) (← links)
- Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints (Q868990) (← links)
- An \(O( n^2)\) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness (Q880552) (← links)
- A note on minimizing maximum lateness in a one-machine sequencing problem with release dates (Q1065705) (← links)
- Single machine scheduling with deadlines and increasing rates of processing times (Q1567197) (← links)
- The Pareto-optimal set of the NP-hard problem of minimization of the maximum lateness for a single machine (Q1951910) (← links)
- An exact algorithm for the preemptive single machine scheduling of equal-length jobs (Q2147002) (← links)
- Scheduling a single machine with primary and secondary objectives (Q2331605) (← 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)
- Scheduling dedicated jobs with variative processing times (Q5963650) (← links)
