The two-machine flow-shop problem with weighted late work criterion and common due date
From MaRDI portal
Recommendations
- A note on the two machine job shop with the weighted late work criterion
- Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date
- Dominance relations for two-machine flow shop problem with late work criterion
- KI 2005: Advances in Artificial Intelligence
- A note on multimachine scheduling with weighted early/late work criteria and common due date
Cites work
- Algorithms for Scheduling Imprecise Computations with Timing Constraints
- Approximation algorithms for scheduling a single machine to minimize total late work
- scientific article; zbMATH DE number 1594554 (Why is no real title available?)
- scientific article; zbMATH DE number 1640601 (Why is no real title available?)
- scientific article; zbMATH DE number 3902030 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1167865 (Why is no real title available?)
- Minimizing Maximum Weighted Error for Imprecise Computation Tasks
- Minimizing mean weighted execution time loss on identical and uniform processors
- Open shop scheduling problems with late work criteria.
- Operations scheduling with applications in manufacturing and services. With 3.5 disk package
- Optimal two- and three-stage production schedules with set-up time included
- Scheduling shops to minimize the weighted number of late jobs
- Single Machine Scheduling to Minimize Total Late Work
Cited in
(28)- Open shop scheduling problems with late work criteria.
- On the exact solution of the no-wait flow shop problem with due date constraints
- Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work
- Scheduling on parallel identical machines with late work criterion: offline and online cases
- Minimizing total weighted late work in the resource-constrained project scheduling problem
- Minimizing total late work on a single machine with generalized due-dates
- Optimally rescheduling jobs with a last-in-first-out buffer
- Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works
- Two-machine flow shop scheduling with a common due date to maximize total early work
- A common approximation framework for early work, late work, and resource leveling problems
- Single-machine scheduling with multi-agents to minimize total weighted late work
- Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date
- Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date
- Scheduling with competing agents, total late work and job rejection
- A note on ``Two-machine flow-shop scheduling with rejection and its link with flow-shop scheduling and common due date assignment
- Two-machine flow-shop scheduling to minimize total late work: revisited
- KI 2005: Advances in Artificial Intelligence
- 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
- Exact approaches to late work scheduling on unrelated machines
- Dominance relations for two-machine flow shop problem with late work criterion
- A note on multimachine scheduling with weighted early/late work criteria and common due date
- Minimizing total weighted late work in a proportionate flow shop with job rejection
- Single-machine preemptive scheduling with assignable due dates or assignable weights to minimize total weighted late work
- Minimizing the maximum late work for a single-machine scheduling problem with flexible maintenance activities
- Semi-online scheduling on two identical machines with a common due date to maximize total early work
- A multi-objective particle swarm for a flow shop scheduling problem
- A note on the two machine job shop with the weighted late work criterion
This page was built for publication: The two-machine flow-shop problem with weighted late work criterion and common due date
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1772844)
