Minimizing the total weighted flow time in a single machine with controllable processing times

DOI10.1016/S0305-0548(03)00187-4zbMath1073.90017MaRDI QIDQ1886005

Moshe Kaspi, Dvir Shabtay

Publication date: 12 November 2004

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

zbMATH Keywords

Dynamic programmingHeuristicsOptimizationResource allocationSingle-machine schedulingWeighted flow time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39) Environmental economics (natural resource models, harvesting, pollution, etc.) (91B76) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (37)

Bicriteria robotic cell scheduling ⋮ Single-machine scheduling with resource-dependent processing times and multiple unavailability periods ⋮ Single-Machine Scheduling with Learning Effect, Deteriorating Jobs and Convex Resource Dependent Processing Times ⋮ A survey of scheduling with controllable processing times ⋮ Considering manufacturing cost and scheduling performance on a CNC turning machine ⋮ Single machine scheduling problems with controllable processing times and total absolute differences penalties ⋮ Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function ⋮ Scheduling with tool changes to minimize total completion time under controllable machining conditions ⋮ 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 ⋮ Scheduling parallel CNC machines with time/cost trade-off considerations ⋮ Single machine scheduling problem with controllable processing times and resource dependent release times ⋮ Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness ⋮ Bicriterion scheduling with truncated learning effects and convex controllable processing times ⋮ Two-machine flow shop scheduling with convex resource consumption functions ⋮ Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey ⋮ 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 ⋮ Single machine scheduling with total tardiness criterion and convex controllable processing times ⋮ A Review for Submodular Optimization on Machine Scheduling Problems ⋮ 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 ⋮ Resource cost aware scheduling ⋮ Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times ⋮ Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time ⋮ A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates ⋮ 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 ⋮ Single machine common flow allowance scheduling with controllable processing times ⋮ Optimal due date assignment and resource allocation in a group technology scheduling environment ⋮ Minimizing total tardiness on a single machine with controllable processing times ⋮ Multicriteria scheduling ⋮ A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems

Cites Work

• 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
• Some comments on sequencing with controllable 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
• Single machine batch scheduling with resource dependent setup and processing times

This page was built for publication: Minimizing the total weighted flow time in a single machine with controllable processing times