Some comments on sequencing with controllable processing times
From MaRDI portal
Publication:1599819
DOI10.1007/s00607-001-1441-xzbMath1002.90027OpenAlexW1488090470MaRDI QIDQ1599819
Gerhard J. Woeginger, Hoogeveen, J. A.
Publication date: 20 January 2003
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00607-001-1441-x
computational complexityschedulingsingle machinesequencingcontrollable processing timebicriterion optimization
Deterministic scheduling theory in operations research (90B35) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
Minimizing the total weighted flow time in a single machine with controllable processing times, Scheduling with controllable processing times and compression costs using population-based heuristics, Optimal allocation and processing time decisions on non-identical parallel CNC machines: \(\epsilon\)-constraint approach, Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications, A survey of scheduling with controllable processing times, Single machine scheduling problems with controllable processing times and total absolute differences penalties, Batch scheduling of identical jobs with controllable processing times, Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs, Single machine scheduling with resource allocation and learning effect considering the rate-modifying activity, Single machine scheduling problem with controllable processing times and resource dependent release times, Pre-emptive scheduling problems with controllable processing times, The symmetric quadratic knapsack problem: approximation and scheduling applications, 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, 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, Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches, Complexity of a scheduling problem with controllable processing times, Single machine scheduling with common due date and controllable processing times, 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, A \(\frac 32\)-approximation algorithm for parallel machine scheduling with controllable processing times, 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, SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES BY SUBMODULAR OPTIMIZATION, Multicriteria scheduling, Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product
