Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine

DOI10.1016/S0305-0548(03)00081-9zbMath1073.90016MaRDI QIDQ1885985

Dvir Shabtay

Publication date: 12 November 2004

Published in: Computers \& Operations Research (Search for Journal in Brave)

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (23)

Single machine batch scheduling to minimize total completion time and resource consumption costs ⋮ Single-Machine Scheduling with Learning Effect, Deteriorating Jobs and Convex Resource Dependent Processing Times ⋮ A survey of scheduling with controllable processing times ⋮ Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources ⋮ Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey ⋮ Scheduling a batching machine with convex resource consumption functions ⋮ A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates ⋮ A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates ⋮ Bi-criteria and tri-criteria analysis to minimize maximum lateness makespan and resource consumption for scheduling a single machine ⋮ Scheduling parallel dedicated machines with the speeding‐up resource ⋮ The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times ⋮ Single-machine scheduling with machine unavailability periods and resource dependent processing times ⋮ A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine ⋮ Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times ⋮ The resource dependent assignment problem with a convex agent cost function ⋮ A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates ⋮ Single‐machine common flow allowance scheduling with aging effect, resource allocation, and a rate‐modifying activity ⋮ Just-in-time scheduling with controllable processing times on parallel machines ⋮ A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates ⋮ A unified approach for scheduling with convex resource consumption functions using positional penalties ⋮ 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 ⋮ Minimizing total tardiness on a single machine with controllable processing times

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A bicriterion approach to time/cost trade-offs in sequencing
• A multi-objective approach to resource allocation in single machine scheduling
• Single machine scheduling subject to deadlines and resource dependent processing times
• Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy
• Solving a class of two-resource allocation problem by equivalent load method
• Bicriterion Single Machine Scheduling with Resource Dependent Processing Times
• Allocation of resources in project management
• Cost-effectiveness of a preventive counseling and support package for postnatal depression
• Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions

This page was built for publication: Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine