A GRASP for a difficult single machine scheduling problem

DOI10.1016/0305-0548(91)90001-8zbMath0741.90033OpenAlexW1971204143MaRDI QIDQ1184452

Jonathan F. Bard, Krishnamurthi Venkatraman, Thomas A. Feo

Publication date: 28 June 1992

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(91)90001-8

zbMATH Keywords

single machine schedulingflow timegreedy randomized adaptive search procedureearliness penalties

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 (24)

Metaheuristics for the risk-constrained cash-in-transit vehicle routing problem ⋮ Minimizing the sum of weighted completion times with unrestricted weights ⋮ Computational aspects of the maximum diversity problem ⋮ A large neighbourhood metaheuristic for the risk-constrained cash-in-transit vehicle routing problem ⋮ A GRASP for simultaneously assigning and sequencing product families on flexible assembly lines ⋮ Improved modeling and solution methods for the multi-resource routing problem ⋮ Metaheuristics: A bibliography ⋮ A sequential GRASP for the therapist routing and scheduling problem ⋮ A biobjective decision model to increase security and reduce travel costs in the cash-in-transit sector ⋮ A GRASP based on DE to solve single machine scheduling problem with SDST ⋮ Optimization of real-time multiserver system with two different channels and shortage of maintenance facilities. ⋮ Combining metaheuristics with mathematical programming, constraint programming and machine learning ⋮ Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times ⋮ A production scheduling heuristic for an electronics manufacturer with sequence-dependent setup costs ⋮ Single machine scheduling with flow time and earliness penalties ⋮ Combining metaheuristics with mathematical programming, constraint programming and machine learning ⋮ A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment ⋮ Scheduling of outbound luggage handling at airports ⋮ Greedy randomized adaptive search procedures ⋮ A model for warehouse order picking ⋮ Randomized methods for the number partitioning problem ⋮ Real-time multiserver and multichannel systems with shortage of maintenance crews. ⋮ Real-time system with homogeneous servers and nonidentical channels in steady-state ⋮ A tabu search approach to the constraint satisfaction problem as a general problem solver

Cites Work

• Unnamed Item
• A bi-criterion approach to minimizing inventory costs on a single machine when early shipments are forbidden
• Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
• A probabilistic heuristic for a computationally difficult set covering problem
• Semi-greedy heuristics: An empirical study
• Technical Note—An Improved Lower Bound for Minimizing Weighted Completion Times with Deadlines
• Note—A Branch-and-Bound Approach to the Bicriterion Scheduling Problem Involving Total Flowtime and Range of Lateness
• Note—Operations Sequencing in Discrete Parts Manufacturing
• A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set

This page was built for publication: A GRASP for a difficult single machine scheduling problem