A new perspective on single-machine scheduling problems with late work related criteria
From MaRDI portal
Publication:6160955
Recommendations
- Single Machine Scheduling to Minimize Total Late Work
- Two due date assignment problems in scheduling a single machine
- Single Machine Scheduling to Minimize Total Weighted Late Work
- Single-machine scheduling with deadlines to minimize the total weighted late work
- Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work
Cites work
- scientific article; zbMATH DE number 3902030 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work
- A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates
- A note on a two-agent scheduling problem related to the total weighted late work
- A survey on offline scheduling with rejection
- A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance
- A two-agent single-machine scheduling problem with late work criteria
- Approximation algorithms for scheduling a single machine to minimize total late work
- Approximation schemes for single-machine scheduling with a fixed maintenance activity to minimize the total amount of late work
- Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments
- Bicriteria scheduling for due date assignment with total weighted tardiness
- Clarification of lower bounds of two-machine flow-shop scheduling to minimize total late work
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Due date assignments and scheduling a single machine with a general earliness/tardiness cost function
- Due-date assignment with asymmetric earliness–tardiness cost
- Integer Programming with a Fixed Number of Variables
- Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries
- Minimizing total late work on a single machine with generalized due-dates
- New algorithms for minimizing the weighted number of tardy jobs on a single machine
- On the parameterized tractability of the just-in-time flow-shop scheduling problem
- Optimal due date assignment in multi-machine scheduling environments
- Optimal restricted due date assignment in scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs
- Parameterized complexity of machine scheduling: 15 open problems
- Parameterized multi-scenario single-machine scheduling problems
- Scheduling and fixed-parameter tractability
- Scheduling on parallel identical machines with late work criterion: offline and online cases
- Single Machine Scheduling to Minimize Total Late Work
- Single Machine Scheduling to Minimize Total Weighted Late Work
- Single Machine Scheduling with Flow Allowances
- Single-machine scheduling with multi-agents to minimize total weighted late work
- Single-machine sequencing with controllable processing times
- Single-machine serial-batch delivery scheduling with two competing agents and due date assignment
- Techniques for scheduling with rejection
- Two-machine flow-shop scheduling to minimize total late work: revisited
Cited in
(2)
This page was built for publication: A new perspective on single-machine scheduling problems with late work related criteria
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6160955)
