A Heuristic Solution Procedure to Minimize Makespan on a Single Machine with Non-linear Cost Functions

DOI10.1057/jors.1990.165zbMath0738.90039OpenAlexW1972108617MaRDI QIDQ3974115

Bahram Alidaee

Publication date: 25 June 1992

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/jors.1990.165

zbMATH Keywords

makespanheuristicquadratic and exponential cost functionsstatic single-facility scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (8)

Single machine scheduling under market uncertainty ⋮ Scheduling on a single processor with variable speed ⋮ Uniform parallel machine scheduling problems with fixed machine cost ⋮ Single-machine scheduling with nonlinear deterioration ⋮ Single-machine makespan minimization scheduling with nonlinear shortening processing times ⋮ Scheduling in a contaminated area: a model and polynomial algorithms ⋮ Single-machine scheduling problems with start-time dependent processing time ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems

This page was built for publication: A Heuristic Solution Procedure to Minimize Makespan on a Single Machine with Non-linear Cost Functions