Scheduling Jobs with Linear Delay Penalties and Sequence Dependent Setup Costs

DOI10.1287/opre.29.1.146zbMath0454.90037OpenAlexW2067810840MaRDI QIDQ3902810

Lawrence K. Vanston, J. Wesley Barnes

Publication date: 1981

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.29.1.146

zbMATH Keywords

traveling salesman problembranching rulescomputational experienceheuristic approachjob schedulingbranch-and-bound algorithmshybrid algorithmrandom test problemsone-machine sequencingcalculation of optimal strategiessequence dependent setup costslinear delay penaltiescontinuously available machinefathoming criterion

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items

A tabu search experience in production scheduling, Scheduling in a sequence dependent setup environment with genetic search, A MILP model for then-job,M-stage flowshop with sequence dependent set-up times, Multiple and bicriteria scheduling: A literature survey, A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup times, A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups, Scheduling of parallel machines with sequence-dependent batches and product incompatibilities in an automotive glass facility, Single machine sequencing with nonlinear multicriteria cost functions: An application of generalized dynamic programming, Single machine scheduling with flow time and earliness penalties, Impact of sequence-dependent setup time on job shop scheduling performance, Implementing and testing the tabu cycle and conditional probability methods, Multicriteria scheduling problems: a survey, Genetic algorithms for the two-stage bicriteria flowshop problem, A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties