The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution

DOI10.1287/mnsc.24.5.530zbMath0371.90065OpenAlexW2123948245MaRDI QIDQ4147829

W. Townsend

Publication date: 1978

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.24.5.530

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)

Related Items

A mapping-based universal kriging model for order-of-addition experiments in drug combination studies ⋮ A bicriterion scheduling problem involving total flowtime and total tardiness ⋮ Scheduling jobs with general truncated learning effects including proportional setup times ⋮ An extended study on an open-shop scheduling problem using the minimisation of the sum of quadratic completion times ⋮ Single machine scheduling with exponential time-dependent learning effect and past-sequence-dependent setup times ⋮ Several flow shop scheduling problems with truncated position-based learning effect ⋮ Flowshop scheduling with a general exponential learning effect ⋮ Single-machine scheduling with general learning functions ⋮ Some scheduling problems with general position-dependent and time-dependent learning effects ⋮ Solving a stochastic single machine problem with initial idle time and quadratic objective ⋮ The local-global conjecture for scheduling with non-linear cost ⋮ A Branch-and-Bound approach to solve a Bicriterion Scheduling Problem involving Squared Flowtime and Maximum Tardiness ⋮ Minimizing a Quadratic Function of Job Lateness in the Single Machine System ⋮ Scheduling problems with past-sequence-dependent setup times and general effects of deterioration and learning ⋮ Single machine past-sequence-dependent delivery times scheduling with general position-dependent and time-dependent learning effects ⋮ Single-machine scheduling problems with an actual time-dependent deterioration ⋮ Optimal sequences in stochastic single machine shops ⋮ Some single-machine scheduling problems with actual time and position dependent learning effects ⋮ General stochastic single-machine scheduling with regular cost functions ⋮ Online scheduling of simple linear deteriorating jobs to minimize the total general completion time ⋮ Single machine scheduling with exponential sum-of-logarithm-processing-times based learning effect ⋮ Single-machine scheduling with a general sum-of-actual-processing-times-based and job-position-based learning effect ⋮ Single machine quadratic penalty function scheduling with deteriorating jobs and group technology ⋮ Generalized pairwise interchanges and machine scheduling ⋮ Several single-machine scheduling problems with general learning effects ⋮ Single machine scheduling with general time-dependent deterioration, position-dependent learning and past-sequence-dependent setup times ⋮ Scheduling jobs with truncated exponential learning functions ⋮ On Ordering Problems: A Statistical Approach ⋮ Scheduling jobs with an exponential sum-of-actual-processing-time-based learning effect ⋮ Single machine scheduling with a general exponential learning effect ⋮ Some single-machine scheduling problems with general effects of learning and deterioration ⋮ Designs for Order-of-Addition Screening Experiments ⋮ Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect ⋮ A Single Machine Bicriterion Scheduling Problem and an Optimizing Branch-and-Bound Procedure ⋮ Some single-machine scheduling with both learning and deterioration effects ⋮ Parametric precedence relations in single machine scheduling ⋮ A note on minimizing the sum of quadratic completion times on two identical parallel machines ⋮ Single machine scheduling with sum-of-logarithm-processing-times based and position based learning effects ⋮ Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints ⋮ Sequencing jobs on a single machine with a common due data and stochastic processing times ⋮ Online Scheduling with Machine Cost and a Quadratic Objective Function ⋮ Some scheduling problems with past sequence dependent setup times under the effects of nonlinear deterioration and time-dependent learning ⋮ Single-machine scheduling with deteriorating jobs ⋮ Scheduling jobs on a single machine to maximize the total revenue of jobs ⋮ A scheduling problem with job values given as a power function of their completion times ⋮ A new lower bound approach for single-machine multicriteria scheduling ⋮ On the asymptotic optimality and improved strategies of SPTB heuristic for open-shop scheduling problem ⋮ Single machine past-sequence-dependent setup times scheduling with general position-dependent and time-dependent learning effects ⋮ Learning effect and deteriorating jobs in the single machine scheduling problems ⋮ Minimizing the weighted sum of squared tardiness on a single machine ⋮ A note on single-machine scheduling with decreasing time-dependent job processing times ⋮ Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning ⋮ Study on flow shop scheduling with sum-of-logarithm-processing-times-based learning effects ⋮ Machine scheduling problems with a position-dependent deterioration ⋮ Single-machine scheduling with both deterioration and learning effects ⋮ Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem ⋮ Single machine scheduling with nonlinear cost functions ⋮ Algorithms for a class of single-machine weighted tardiness and earliness problems ⋮ On the complexity of the single machine scheduling problem minimizing total weighted delay penalty ⋮ Single-machine scheduling problems with start-time dependent processing time ⋮ Single-machine scheduling problems with the time-dependent learning effect ⋮ Single machine jobshop scheduling problem with weighted quadratic function of job lateness: A branch-and-bound approach ⋮ Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects ⋮ Solution of the generalized Townsend single machine scheduling model ⋮ Single Machine Schednling Problem with Quadratic Function of Completion Times-A Modified Approach ⋮ An improved precedence rule for single machine sequencing problems with quadratic penalty ⋮ Minimizing the sum of squares lateness on a single machine ⋮ A Note on Scheduling Jobs with Extended Sum-of-Processing-Times-Based and Position-Based Learning Effect ⋮ Some Scheduling Problems on a Single Machine with General Job Effects of Position-Dependent Learning and Start-Time-Dependent Deterioration ⋮ The Sngle Machine Problem with Quadratic Penalty Function ⋮ For the airplane refueling problem local precedence implies global precedence ⋮ Designs for order-of-addition experiments ⋮ Average-case analysis of best-first search in two representative directed acyclic graphs