A unified approach for scheduling with convex resource consumption functions using positional penalties
DOI10.1016/J.EJOR.2010.02.026zbMATH Open1188.90099OpenAlexW2023874278MaRDI QIDQ976312FDOQ976312
Authors: Yaron Leyvand, Dvir Shabtay, 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
Recommendations
- A unified analysis for the single-machine scheduling problem with controllable and non-controllable variable job processing times
- Single machine scheduling with total tardiness criterion and convex controllable processing times
- Single-machine scheduling problems with controllable processing times and learning effect
- Single machine due-window assignment and scheduling with controllable processing times
- Scheduling problems with controllable processing times and learning effects
resource allocationsingle machine schedulingpolynomial-time algorithmdue date assignmentcontrollable processing timespositional penalties
Deterministic scheduling theory in operations research (90B35) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Cites Work
- Title not available (Why is that?)
- Some comments on sequencing with controllable processing times
- A survey of scheduling with controllable processing times
- Single machine scheduling with controllable release and processing parameters
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A survey of results for sequencing problems with controllable processing times
- Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Allocation of resources in project management
- Common due window size and location determination in a single machine scheduling problem
- Title not available (Why is that?)
- Single Machine Scheduling with Flow Allowances
- Two due date assignment problems in scheduling a single machine
- Single machine scheduling subject to deadlines and resource dependent processing times
- Two parallel machine sequencing problems involving controllable job processing times
- Scheduling with controllable release dates and processing times: total completion time minimization
- Single machine scheduling problems with controllable processing times and total absolute differences penalties
- Pre-emptive scheduling problems with controllable processing times
- Scheduling Multiple Variable-Speed Machines
- 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
- Minimizing the total weighted flow time in a single machine with controllable processing times
- A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine
- Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions
- Group scheduling with controllable setup and processing times: minimizing total weighted completion time
- Single machine scheduling with a variable common due date and resource-dependent processing times.
- Single-machine sequencing with controllable processing times
- A single machine scheduling problem with common due window and controllable processing times
- The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times
- Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine
- Title not available (Why is that?)
- Solving a class of two-resource allocation problem by equivalent load method
- Cost-effectiveness of a preventive counseling and support package for postnatal depression
- A permutation flow-shop scheduling problem with convex models of operation processing times
Cited In (17)
- Due-date assignment with acceptable lead-times on parallel machines
- A multi-stage stochastic programming approach in master production scheduling
- Optimal due-date assignment problem with learning effect and resource-dependent processing times
- A unified analysis for scheduling problems with variable processing times
- Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection
- Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources
- Minsum scheduling with acceptable lead-times and optional job rejection
- Single-machine past-sequence-dependent setup times scheduling with resource allocation and learning effect
- Scheduling with learning effects and/or time-dependent processing times to minimize the weighted number of tardy jobs on a single machine
- A survey on scheduling problems with due windows
- Single-machine group scheduling with deteriorating jobs and allotted resource
- Single-machine scheduling with learning effect, deteriorating jobs and convex resource dependent processing times
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
- SCHEDULING JOBS WITH PROCESSING TIMES DEPENDENT ON POSITION, STARTING TIME, AND ALLOTTED RESOURCE
- Simple matching vs linear assignment in scheduling models with positional effects: a critical review
- Single-machine due-window assignment and scheduling with learning effect and resource-dependent processing times
- Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine
This page was built for publication: A unified approach for scheduling with convex resource consumption functions using positional penalties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976312)