The following pages link to (Q3680271):
Displaying 45 items.
- A single machine scheduling problem to minimize total early work (Q342425) (← links)
- Minimizing mean weighted execution time loss on identical and uniform processors (Q581214) (← links)
- A note on a single machine scheduling problem with generalized total tardiness objective function (Q763495) (← links)
- Semi-online scheduling on two identical machines with a common due date to maximize total early work (Q827603) (← links)
- A note on the two machine job shop with the weighted late work criterion (Q880589) (← links)
- Scheduling two agents with controllable processing times (Q976351) (← links)
- Approximation algorithms for scheduling a single machine to minimize total late work (Q1196210) (← links)
- Minimizing the weighted number of tardy task units (Q1329790) (← links)
- Scheduling imprecise computation tasks with \(0/1\)-constraint (Q1377660) (← links)
- Open shop scheduling problems with late work criteria. (Q1421458) (← links)
- Minimizing the total weighted late work in scheduling of identical parallel processors with communication delays (Q1631999) (← links)
- Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work (Q1673940) (← links)
- A two-agent single-machine scheduling problem with late work criteria (Q1701708) (← links)
- Scheduling on parallel identical machines with late work criterion: offline and online cases (Q1702733) (← links)
- Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches (Q1754151) (← links)
- The two-machine flow-shop problem with weighted late work criterion and common due date (Q1772844) (← links)
- Minimizing total weighted late work in the resource-constrained project scheduling problem (Q1792320) (← links)
- Minimizing total late work on a single machine with generalized due-dates (Q2030324) (← links)
- Mirror scheduling problems with early work and late work criteria (Q2066692) (← links)
- Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works (Q2083387) (← links)
- Two-machine flow shop scheduling with a common due date to maximize total early work (Q2116855) (← links)
- Minimizing total weighted late work on a single-machine with non-availability intervals (Q2165284) (← links)
- A common approximation framework for early work, late work, and resource leveling problems (Q2184097) (← links)
- A survey of due-date related single-machine with two-agent scheduling problem (Q2190270) (← links)
- Single-machine scheduling with multi-agents to minimize total weighted late work (Q2197329) (← links)
- Two competitive agents to minimize the weighted total late work and the total completion time (Q2243272) (← links)
- Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date (Q2301935) (← links)
- Two-agent scheduling problems on a single-machine to minimize the total weighted late work (Q2359798) (← links)
- Scheduling imprecise computation tasks on uniform processors (Q2379995) (← links)
- Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date (Q2384909) (← links)
- A note on a two-agent scheduling problem related to the total weighted late work (Q2424661) (← links)
- Scheduling with competing agents, total late work and job rejection (Q2668778) (← links)
- Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work (Q2673557) (← links)
- A Branch-and-Bound Algorithm for Two-Agent Scheduling with Learning Effect and Late Work Criterion (Q4689397) (← links)
- A Parallel Machine Scheduling Problem Maximizing Total Weighted Early Work (Q5024913) (← links)
- Two-machine flow-shop scheduling to minimize total late work: revisited (Q5059191) (← links)
- A parallel-machine scheduling problem with an antithetical property to maximize total weighted early work (Q6054012) (← links)
- Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work (Q6057022) (← links)
- Variable neighborhood search for the single machine scheduling problem to minimize the total early work (Q6063510) (← links)
- Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work (Q6076476) (← links)
- Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work (Q6077487) (← links)
- Maximizing total early work in a distributed two‐machine flow‐shop (Q6078603) (← links)
- Exact approaches to late work scheduling on unrelated machines (Q6093431) (← links)
- Single-machine preemptive scheduling with release dates involving the total weighted late work criterion (Q6093999) (← links)
- A new perspective on single-machine scheduling problems with late work related criteria (Q6160955) (← links)
