Pages that link to "Item:Q4017089"

The following pages link to Single Machine Scheduling to Minimize Total Late Work (Q4017089):

Displaying 50 items.

• A single machine scheduling problem to minimize total early work (Q342425) (← links)
• A study of single-machine scheduling problem to maximize throughput (Q398860) (← links)
• Single machine scheduling with nonlinear lateness cost functions and fuzzy due dates (Q697023) (← links)
• Exact and heuristic algorithms for minimizing tardy/lost penalties on a single-machine scheduling problem (Q725705) (← 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)
• An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs (Q1306357) (← 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)
• 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)
• The two-machine flow-shop problem with weighted late work criterion and common due date (Q1772844) (← links)
• Improving the complexities of approximation algorithms for optimization problems (Q1904613) (← links)
• Multivariate composite distributions for coefficients in synthetic optimization problems (Q1969891) (← links)
• Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work (Q2025084) (← 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)
• A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← 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)
• Approximation algorithms for minimizing the total weighted tardiness on a single machine (Q2368997) (← 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)
• A family of composite discrete bivariate distributions with uniform marginals for simulating realistic and challenging optimization-problem instances (Q2629710) (← 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)
• THE NP-HARDNESS OF MINIMIZING THE TOTAL LATE WORK ON AN UNBOUNDED BATCH MACHINE (Q3392292) (← links)
• Single machine scheduling to minimize the setup time and the earliness (Q3411902) (← links)
• A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work (Q4294731) (← links)
• Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work (Q4632917) (← links)
• A DUAL CRITERIA PREEMPTIVE SCHEDULING PROBLEM FOR MINIMAX ERROR OF IMPRECISE COMPUTATION TASKS (Q4667920) (← links)
• A Branch-and-Bound Algorithm for Two-Agent Scheduling with Learning Effect and Late Work Criterion (Q4689397) (← links)
• Proportionate Flow Shop Scheduling with Two Competing Agents to Minimize Weighted Late Work and Weighted Number of Late Jobs (Q5012893) (← 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)
• Single‐machine scheduling with deadlines to minimize the total weighted late work (Q5241424) (← links)
• Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work (Q6057022) (← links)