Pre-emptive scheduling problems with controllable processing times

DOI10.1007/s10951-005-6813-1zbMath1123.90035OpenAlexW2015790145MaRDI QIDQ880501

Vitaly A. Strusevich, Natalia V. Shakhlevich

Publication date: 15 May 2007

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-005-6813-1

zbMATH Keywords

single machine schedulingpolymatroidsparallel machine schedulinggreedy algorithmscontrollable processing timesbicriteria problems

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items

Batch scheduling of identical jobs with controllable processing times, Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost, Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey, A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates, Scheduling with due date assignment under special conditions on job processing, Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints, Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach, Preemptive scheduling on uniform parallel machines with controllable job processing times, A Review for Submodular Optimization on Machine Scheduling Problems, Single-machine scheduling with machine unavailability periods and resource dependent processing times, Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches, Pseudo-polynomial dynamic programming for an integrated due date assignment, resource allocation, production, and distribution scheduling model in supply chain scheduling, Just-in-time scheduling with controllable processing times on parallel machines, A unified approach for scheduling with convex resource consumption functions using positional penalties, Scheduling two agents with controllable processing times, Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling, Application of Submodular Optimization to Single Machine Scheduling with Controllable Processing Times Subject to Release Dates and Deadlines, Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times, SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES BY SUBMODULAR OPTIMIZATION, Power-aware scheduling for makespan and flow

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of results for sequencing problems with controllable processing times
• Generalized polymatroids and submodular flows
• A bicriterion approach to time/cost trade-offs in sequencing
• Single machine scheduling subject to deadlines and resource dependent processing times
• Minimization of the makespan in a two-machine problem under given resource constraints
• Minimizing the weighted number of tardy task units
• Some comments on sequencing with controllable processing times
• Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard.
• Positive half-products and scheduling with controllable processing times
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times
• Scheduling with Deadlines and Loss Functions
• Scheduling jobs with controllable processing times as an optimal control problem
• Algorithms for Scheduling Imprecise Computations with Timing Constraints
• Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
• An Algorithm for Large Zero-One Knapsack Problems
• Resource optimal control in some single-machine scheduling problems
• Bicriterion Single Machine Scheduling with Resource Dependent Processing Times
• Some simple scheduling algorithms
• Single machine batch scheduling with resource dependent setup and processing times