Fifty years of scheduling: a survey of milestones
From MaRDI portal
Publication:3394051
DOI10.1057/jors.2009.2zbMath1168.90311OpenAlexW2087411299MaRDI QIDQ3394051
Chris N. Potts, Vitaly A. Strusevich
Publication date: 28 August 2009
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://eprints.soton.ac.uk/145495/1/Scheduling50YearsE-Print.pdf
History of mathematics in the 20th century (01A60) History of mathematics in the 21st century (01A61) History of operations research and mathematical programming (90-03)
Related Items (34)
New hard benchmark for flowshop scheduling problems minimising makespan ⋮ Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop ⋮ Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ An extended study on an open-shop scheduling problem using the minimisation of the sum of quadratic completion times ⋮ An effective heuristic algorithm for the partial shop scheduling problem ⋮ An effective lower bound on \(L_{\max}\) in a worker-constrained job shop ⋮ Minimizing Total Idle Energy Consumption in the Permutation Flow Shop Scheduling Problem ⋮ A neighborhood for complex job shop scheduling problems with regular objectives ⋮ Optimizing makespan and stability risks in job shop scheduling ⋮ Performance analysis of fixed assignment policies for stochastic online scheduling on uniform parallel machines ⋮ A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem ⋮ Exact algorithms for solving the constrained parallel-machine scheduling problems with divisible processing times and penalties ⋮ Literature reviews in operations research: a new taxonomy and a meta review ⋮ Firefly-Inspired Algorithm for Job Shop Scheduling ⋮ Vyacheslav Tanaev: contributions to scheduling and related areas ⋮ A mathematical model for the management of a service center ⋮ Scheduling cleaning activities on trains by minimizing idle times ⋮ A three-stage optimization algorithm for the stochastic parallel machine scheduling problem with adjustable production rates ⋮ Unnamed Item ⋮ A time-indexed LP-based approach for min-sum job-shop problems ⋮ A local search algorithm for the flow shop scheduling problem with release dates ⋮ A branch-and-bound algorithm for minimizing the energy consumption in the PFS problem ⋮ Scheduling for fabrication and assembly in a two-machine flowshop with a fixed job sequence ⋮ Performance analysis of the \((1+1)\) evolutionary algorithm for the multiprocessor scheduling problem ⋮ A simulation‐based differential evolution algorithm for stochastic parallel machine scheduling with operational considerations ⋮ On the asymptotic optimality and improved strategies of SPTB heuristic for open-shop scheduling problem ⋮ Flow shop scheduling with heterogeneous workers ⋮ An effective new heuristic algorithm for solving permutation flow shop scheduling problem ⋮ Asymptotic analysis of online algorithms and improved scheme for the flow shop scheduling problem with release dates ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems ⋮ Three-stage ordered flow shops with either synchronous flow, blocking or no-idle machines ⋮ Multi-objective open shop scheduling by considering human error and preventive maintenance ⋮ Scheduling meets \(n\)-fold integer programming ⋮ The Pareto frontier of inefficiency in mechanism design
This page was built for publication: Fifty years of scheduling: a survey of milestones
