A survey of results for sequencing problems with controllable processing times

DOI10.1016/0166-218X(90)90105-LzbMath0693.90056OpenAlexW2020909460MaRDI QIDQ908846

Eugeniusz Nowicki, Stanisław Zdrzałka

Publication date: 1990

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(90)90105-l

zbMATH Keywords

upper boundsingle machinelower boundworst-case performanceheuristicmaximum completion timemaximum latenesstotal weighted completion timecomplexity resultscontrollable processing time

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Sequencing games with controllable processing times, Flow shop scheduling with flexible processing times, Approximation schemes for parallel machine scheduling problems with controllable processing times, Single machine batch scheduling to minimize total completion time and resource consumption costs, Single-machine scheduling with trade-off between number of tardy jobs and compression cost, Scheduling with controllable processing times and compression costs using population-based heuristics, Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications, Loading and scheduling for flexible manufacturing systems with controllable processing times, A survey of scheduling with controllable processing times, Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches, Scheduling under linear constraints, Single machine scheduling with rejection to minimize the weighted makespan, Single-machine batch scheduling problem with job rejection and resource dependent processing times, Considering manufacturing cost and scheduling performance on a CNC turning machine, Single machine scheduling problems with controllable processing times and total absolute differences penalties, Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times, Single-machine scheduling with trade-off between number of tardy jobs and resource allocation, Single machine scheduling with discretely controllable processing times, Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources, A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times, Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost, Single machine scheduling problem with controllable processing times and resource dependent release times, Pre-emptive scheduling problems with controllable processing times, Unrelated parallel machine scheduling problem with special controllable processing times and setups, Scheduling problems with rejection to minimize the \(k\)-th power of the makespan plus the total rejection cost, Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times, The symmetric quadratic knapsack problem: approximation and scheduling applications, Single machine scheduling with rejection to minimize the \(k\)-th power of the makespan, Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey, Single-machine scheduling with time-and-resource-dependent processing times, Scheduling with controllable release dates and processing times: Makespan minimization, Scheduling with controllable release dates and processing times: total completion time minimization, Single machine scheduling with controllable release and processing parameters, 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, Single machine scheduling with a variable common due date and resource-dependent processing times., A genetic algorithm-based approach for single-machine scheduling with learning effect and release time, Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints, Proportionate flow shop with controllable processing times, Single-machine group scheduling with deteriorating jobs and allotted resource, Preemptive scheduling on uniform parallel machines with controllable job processing times, A Review for Submodular Optimization on Machine Scheduling Problems, Scheduling parallel dedicated machines with the speeding‐up resource, The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times, Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: Worst-case analysis, Two-machine open shop problem with controllable processing times, Single‐machine scheduling problem with resource dependent release dates to minimise total resource‐consumption, A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine, SCHEDULING JOBS WITH PROCESSING TIMES DEPENDENT ON POSITION, STARTING TIME, AND ALLOTTED RESOURCE, An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach, Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches, Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time, Approximation schemes for job shop scheduling problems with controllable processing times, Single machine scheduling with common due date and controllable processing times, Single machine scheduling with resource dependent release times and 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, A search method for optimal control of a flow shop system of traditional machines, A \(\frac 32\)-approximation algorithm for parallel machine scheduling with controllable processing times, SCHEDULING WITH DISCRETELY COMPRESSIBLE RELEASE DATES TO MINIMIZE MAKESPAN, Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling, Minimizing completion time variance with compressible processing times, Single machine common flow allowance scheduling with controllable processing times, Optimal due date assignment and resource allocation in a group technology scheduling environment, Minimizing total tardiness on a single machine with controllable processing times, Application of Submodular Optimization to Single Machine Scheduling with Controllable Processing Times Subject to Release Dates and Deadlines, The Fixed-Charge Shortest-Path Problem, 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, Single machine scheduling with controllable processing times and compression costs. I: Equal times and costs, Scheduling in network flow shops, Multicriteria scheduling, A new bounding mechanism for the CNC machine scheduling problems with controllable processing times, Single–machine scheduling with random machine breakdowns and randomly compressible processing times, Two parallel machine sequencing problems involving controllable job processing times, An approximation algorithm for the \(m\)-machine permutation flow shop scheduling problem with controllable processing times, Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard., An approximation algorithm for a single-machine scheduling problem with release times, delivery times and controllable processing times, An unconstrained optimization problem is NP-hard given an oracle representation of its objective function: a technical note, Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduling subject to resource constraints: Classification and complexity
• A two-machine flow shop scheduling problem with controllable job processing times
• Multiobjective network scheduling with efficient use of renewable and nonrenewable resources
• A bicriterion approach to time/cost trade-offs in sequencing
• Job-shop scheduling with resource-time models of operations
• Optimal two- and three-stage production schedules with setup times included
• A Generalized Uniform Processor System
• Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
• Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
• Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case
• Minimizing maximum lateness on one machine: computational experience and some applications
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• A Functional Equation and its Application to Resource Allocation and Sequencing Problems
• The Theory of Networks and Management Science. Part I