A unified approach for scheduling with convex resource consumption functions using positional penalties

DOI10.1016/j.ejor.2010.02.026zbMath1188.90099OpenAlexW2023874278MaRDI QIDQ976312

Dvir Shabtay, Yaron Leyvand, George Steiner

Publication date: 11 June 2010

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2010.02.026

zbMATH Keywords

resource allocationpolynomial-time algorithmsingle machine schedulingdue date assignmentcontrollable processing timespositional penalties

Mathematics Subject Classification ID

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

Related Items

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 ⋮ 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 ⋮ Simple matching vs linear assignment in scheduling models with positional effects: a critical review ⋮ Single-machine past-sequence-dependent setup times scheduling with resource allocation and learning effect ⋮ A multi-stage stochastic programming approach in master production scheduling ⋮ Optimal due-date assignment problem with learning effect and resource-dependent processing times ⋮ Single-machine group scheduling with deteriorating jobs and allotted resource ⋮ Scheduling with learning effects and/or time-dependent processing times to minimize the weighted number of tardy jobs on a single machine ⋮ SCHEDULING JOBS WITH PROCESSING TIMES DEPENDENT ON POSITION, STARTING TIME, AND ALLOTTED RESOURCE ⋮ Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine ⋮ A unified analysis for scheduling problems with variable processing times ⋮ A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Single machine scheduling problems with controllable processing times and total absolute differences penalties
• Two due date assignment problems in scheduling a single machine
• Pre-emptive scheduling problems with controllable processing times
• A survey of results for sequencing problems with controllable processing times
• The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times
• A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine
• Single-machine sequencing with controllable processing times
• Single machine scheduling subject to deadlines and resource dependent processing times
• Two parallel machine sequencing problems involving controllable job processing times
• Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
• A single machine scheduling problem with common due window and controllable processing times
• Single machine scheduling with a variable common due date and resource-dependent processing times.
• A permutation flow-shop scheduling problem with convex models of operation 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
• Group scheduling with controllable setup and processing times: minimizing total weighted completion time
• 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
• Scheduling with controllable release dates and processing times: total completion time minimization
• Single machine scheduling with controllable release and processing parameters
• Common due window size and location determination in a single machine scheduling problem
• Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems
• Minimizing Variation of Flow Time in Single Machine Systems
• Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling Multiple Variable-Speed Machines
• 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