A new perspective on single-machine scheduling problems with late work related criteria

DOI10.1007/S10479-022-04806-0zbMATH Open1517.90058OpenAlexW4311126538MaRDI QIDQ6160955FDOQ6160955

Authors: Dvir Shabtay 

Publication date: 26 June 2023

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-022-04806-0

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

zbMATH Keywords

schedulingsingle machineparameterized complexitydue date assignmentlate work

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Title not available (Why is that?)
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Techniques for scheduling with rejection
• Due date assignments and scheduling a single machine with a general earliness/tardiness cost function
• Integer Programming with a Fixed Number of Variables
• Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
• A survey on offline scheduling with rejection
• Title not available (Why is that?)
• Optimal due date assignment in multi-machine scheduling environments
• Optimal restricted due date assignment in scheduling
• Single Machine Scheduling with Flow Allowances
• Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments
• Title not available (Why is that?)
• Single Machine Scheduling to Minimize Total Late Work
• A note on a two-agent scheduling problem related to the 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
• On the parameterized tractability of the just-in-time flow-shop scheduling problem
• Approximation algorithms for scheduling a single machine to minimize total late work
• Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs
• Single-machine sequencing with controllable processing times
• Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries
• Scheduling and fixed-parameter tractability
• Single-machine serial-batch delivery scheduling with two competing agents and due date assignment
• Scheduling on parallel identical machines with late work criterion: offline and online cases
• Parameterized complexity of machine scheduling: 15 open problems
• A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance
• A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work
• Approximation schemes for single-machine scheduling with a fixed maintenance activity to minimize the total amount of late work
• New algorithms for minimizing the weighted number of tardy jobs on a single machine
• Two-machine flow-shop scheduling to minimize total late work: revisited
• Single Machine Scheduling to Minimize Total Weighted Late Work
• Bicriteria scheduling for due date assignment with total weighted tardiness
• A two-agent single-machine scheduling problem with late work criteria
• Single-machine scheduling with multi-agents to minimize total weighted late work
• Due-date assignment with asymmetric earliness–tardiness cost
• Minimizing total late work on a single machine with generalized due-dates
• Parameterized multi-scenario single-machine scheduling problems
• Clarification of lower bounds of two-machine flow-shop scheduling to minimize total late work

Cited In (2)

• Minimizing total late work on a single machine with generalized due-dates
• Title not available (Why is that?)

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)