The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times

DOI10.1007/s10479-007-0269-yzbMath1151.90432OpenAlexW2150902201MaRDI QIDQ940868

Dvir Shabtay, George Steiner

Publication date: 3 September 2008

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

Full work available at URL: https://doi.org/10.1007/s10479-007-0269-y

zbMATH Keywords

single-machine schedulingresource allocationearliness-tardiness schedulingdue date assignmentcontrollable processing times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (25)

Minsum scheduling with acceptable lead-times and optional job rejection ⋮ A survey on scheduling problems with due windows ⋮ Single-Machine Scheduling with Learning Effect, Deteriorating Jobs and Convex Resource Dependent Processing Times ⋮ Bicriteria scheduling for due date assignment with total weighted tardiness ⋮ Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection ⋮ Single-Machine Due-Window Assignment and Scheduling with Learning Effect and Resource-Dependent Processing Times ⋮ Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources ⋮ Single machine scheduling with resource allocation and learning effect considering the rate-modifying activity ⋮ Single-machine scheduling and slack due-date assignment with aging effect and deteriorating maintenance ⋮ Scheduling with due date assignment under special conditions on job processing ⋮ Optimal due-date assignment problem with learning effect and resource-dependent processing times ⋮ Single-machine group scheduling with deteriorating jobs and allotted resource ⋮ Minmax due-date assignment with a time window for acceptable lead-times ⋮ Minmax due-date assignment on a two-machine flowshop ⋮ SCHEDULING JOBS WITH PROCESSING TIMES DEPENDENT ON POSITION, STARTING TIME, AND ALLOTTED RESOURCE ⋮ The resource dependent assignment problem with a convex agent cost function ⋮ Scheduling problems with position dependent job processing times: computational complexity results ⋮ A unified approach for scheduling with convex resource consumption functions using positional penalties ⋮ A unified analysis for the single-machine scheduling problem with controllable and non-controllable variable job processing times ⋮ Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling ⋮ Optimal due date assignment and resource allocation in a group technology scheduling environment ⋮ Single machine SLK/DIF due window assignment problem with learning effect and deteriorating jobs ⋮ Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms ⋮ SINGLE MACHINE DUE DATE ASSIGNMENT SCHEDULING PROBLEM WITH PRECEDENCE CONSTRAINTS AND CONTROLLABLE PROCESSING TIMES IN FUZZY ENVIRONMENT ⋮ Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries

Cites Work

• Unnamed Item
• Unnamed Item
• Manufacturing lead-time rules: customer retention versus tardiness costs
• Two due date assignment problems in scheduling a single machine
• A survey of results for sequencing problems with controllable processing times
• A bicriterion approach to time/cost trade-offs in sequencing
• A multi-objective approach to resource allocation in single machine scheduling
• Single-machine sequencing with controllable processing times
• Two parallel machine sequencing problems involving controllable job processing times
• Single machine scheduling with a variable common due date and resource-dependent processing times.
• Some comments on sequencing with controllable processing times
• A survey of the state-of-the-art of common due date assignment and scheduling research
• Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard.
• Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine
• Minimizing the total weighted flow time in a single machine with controllable processing times
• A survey of scheduling with controllable processing times
• Sequencing with Earliness and Tardiness Penalties: A Review
• Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
• Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
• Solving a class of two-resource allocation problem by equivalent load method
• Allocation of resources in project management
• Cost-effectiveness of a preventive counseling and support package for postnatal depression
• Single Machine Scheduling with Flow Allowances
• Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions

This page was built for publication: The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times