Single Machine Scheduling to Minimize Total Late Work
From MaRDI portal
Publication:4017089
Recommendations
- Single Machine Scheduling to Minimize Total Weighted Late Work
- Approximation algorithms for scheduling a single machine to minimize total late work
- Single machine scheduling with release and due date assignment to minimize the weighted number of late jobs
- Minimizing total late work on a single machine with generalized due-dates
- A single machine scheduling problem to minimize total early work
Cited in
(80)- Approximation algorithms for scheduling a single machine to minimize total late work
- An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
- Minimizing the weighted number of tardy task units
- Scheduling imprecise computation tasks with \(0/1\)-constraint
- Open shop scheduling problems with late work criteria.
- Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work
- A two-agent single-machine scheduling problem with late work criteria
- Scheduling on parallel identical machines with late work criterion: offline and online cases
- The two-machine flow-shop problem with weighted late work criterion and common due date
- Improving the complexities of approximation algorithms for optimization problems
- Multivariate composite distributions for coefficients in synthetic optimization problems
- Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work
- Minimizing total late work on a single machine with generalized due-dates
- Mirror scheduling problems with early work and late work criteria
- Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
- Two-machine flow shop scheduling with a common due date to maximize total early work
- Minimizing total weighted late work on a single-machine with non-availability intervals
- A common approximation framework for early work, late work, and resource leveling problems
- A survey of due-date related single-machine with two-agent scheduling problem
- Single-machine scheduling with multi-agents to minimize total weighted late work
- Two competitive agents to minimize the weighted total late work and the total completion time
- Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date
- Two-agent scheduling problems on a single-machine to minimize the total weighted late work
- Approximation algorithms for minimizing the total weighted tardiness on a single machine
- Scheduling imprecise computation tasks on uniform processors
- Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date
- A note on a two-agent scheduling problem related to the total weighted late work
- A family of composite discrete bivariate distributions with uniform marginals for simulating realistic and challenging optimization-problem instances
- Scheduling with competing agents, total late work and job rejection
- Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work
- THE NP-HARDNESS OF MINIMIZING THE TOTAL LATE WORK ON AN UNBOUNDED BATCH MACHINE
- Single machine scheduling to minimize the setup time and the earliness
- A single machine scheduling problem to minimize total early work
- A study of single-machine scheduling problem to maximize throughput
- Approximation schemes for single-machine scheduling with a fixed maintenance activity to minimize the total amount of late work
- A DUAL CRITERIA PREEMPTIVE SCHEDULING PROBLEM FOR MINIMAX ERROR OF IMPRECISE COMPUTATION TASKS
- A branch-and-bound algorithm for two-agent scheduling with learning effect and late work criterion
- Single Machine Scheduling to Minimize Total Weighted Late Work
- Proportionate flow shop scheduling with two competing agents to minimize weighted late work and weighted number of late jobs
- Single machine scheduling problem with minimize total weighted early work
- A parallel machine scheduling problem maximizing total weighted early work
- Two-machine flow-shop scheduling to minimize total late work: revisited
- Single-machine scheduling to minimize total weighted late work with positional due-indices
- Single-machine scheduling with deadlines to minimize the total weighted late work
- Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work
- A no-delay single machine scheduling problem to minimize total weighted early and late work
- Variable neighborhood search for the single machine scheduling problem to minimize the total early work
- Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work
- Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work
- Maximizing total early work in a distributed two‐machine flow‐shop
- Two-agent single-machine scheduling with a rate-modifying activity
- Exact approaches to late work scheduling on unrelated machines
- Minimizing tardiness scheduling measures with generalized due-dates and a maintenance activity
- A state-of-the-art survey on multi-scenario scheduling
- A new perspective on single-machine scheduling problems with late work related criteria
- Single machine scheduling with assignable due dates to minimize maximum and total late work
- Online early work scheduling on parallel machines
- Two-agent scheduling of minimizing total weighted late work and maximum cost
- A comparative computational study for parallel-machine problems with sustainable manufacturing constraints
- Scheduling with assignable due dates, two competing agents and late work related criteria
- The single-machine preemptive or resumable scheduling with maintenance intervals
- Minimizing total weighted late work in a proportionate flow shop with job rejection
- Single machine scheduling with nonlinear lateness cost functions and fuzzy due dates
- A systematic review of permutation flow shop scheduling with due-date-related objectives
- Single-machine preemptive scheduling with assignable due dates or assignable weights to minimize total weighted late work
- Minimizing the number of late jobs and total late work with step-learning
- Approximation schemes for parallel machine scheduling to maximize total weighted early work with a common due date
- Scheduling with a discounted profit criterion on identical machines
- Single machine scheduling with the total weighted late work and rejection cost
- The two single-machine scheduling problems with slack due date to minimize total early work and late work
- Exact and heuristic algorithms for minimizing tardy/lost penalties on a single-machine scheduling problem
- Minimizing the maximum late work for a single-machine scheduling problem with flexible maintenance activities
- A preemptive single-machine scheduling problem with a late work criterion and convex resource consumption functions
- Minimizing total weighted late work with step-learning on a single machine
- A linear-time algorithm for a resource-dependent preemptive late-work scheduling problem
- A note on a single machine scheduling problem with generalized total tardiness objective function
- Semi-online scheduling on two identical machines with a common due date to maximize total early work
- A note on the two machine job shop with the weighted late work criterion
- Scheduling two agents with controllable processing times
This page was built for publication: Single Machine Scheduling to Minimize Total Late Work
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4017089)
