Some comments on sequencing with controllable processing times

DOI10.1007/S00607-001-1441-XMaRDI QIDQ1599819zbMATH OpenOpenAlexFDO

Authors Gerhard J. Woeginger, Han Hoogeveen

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

zbMATH Keywords

computational complexityschedulingsingle machinesequencingcontrollable processing timebicriterion optimization

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• A survey of results for sequencing problems with controllable processing times
• Single-machine sequencing with controllable processing times
• Two parallel machine sequencing problems involving controllable job processing times
• scientific article; zbMATH DE number 2044496
• Single machine scheduling with controllable processing times and compression costs. I: Equal times and costs

Cited in

(33)

• Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product
• Single machine common flow allowance scheduling with controllable processing times
• Bi-criteria and tri-criteria analysis to minimize maximum lateness makespan and resource consumption for scheduling a single machine
• Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs
• Single machine scheduling with common due date and controllable processing times
• Approximate sequencing for variable length tasks.
• A survey of results for sequencing problems with controllable processing times
• A \(\frac 32\)-approximation algorithm for parallel machine scheduling with controllable processing times
• Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches
• Single-machine sequencing with controllable processing times
• SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES BY SUBMODULAR OPTIMIZATION
• A unified approach for scheduling with convex resource consumption functions using positional penalties
• A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates
• The symmetric quadratic knapsack problem: approximation and scheduling applications
• Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling
• A survey of scheduling with controllable processing times
• Batch scheduling of identical jobs with controllable processing times
• Single machine scheduling with resource allocation and learning effect considering the rate-modifying activity
• A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine
• Optimal allocation and processing time decisions on non-identical parallel CNC machines: \(\epsilon\)-constraint approach
• Scheduling two agents with controllable processing times
• The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times
• Single machine scheduling problems with controllable processing times and total absolute differences penalties
• Pre-emptive scheduling problems with controllable processing times
• Single machine scheduling problem with controllable processing times and resource dependent release times
• Complexity of a scheduling problem with controllable processing times
• Just-in-time scheduling with controllable processing times on parallel machines
• Two parallel machine sequencing problems involving controllable job processing times
• Minimizing the total weighted flow time in a single machine with controllable processing times
• Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications
• scientific article; zbMATH DE number 5172390 (Why is no real title available?)
• Multicriteria scheduling
• Scheduling with controllable processing times and compression costs using population-based heuristics

This page was built for publication: Some comments on sequencing with controllable processing times

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1599819)