A general approach for optimizing regular criteria in the job-shop scheduling problem
- 1 July 2011
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 212 (1), 33-42
- https://doi.org/10.1016/j.ejor.2011.01.046
Abstract
No abstract availableThis publication has 32 references indexed in Scilit:
- A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problemComputers & Operations Research, 2008
- Comparison of heuristics for flowtime minimisation in permutation flowshopsComputers & Operations Research, 2005
- Tabu search for minimizing total tardiness in a job shopInternational Journal of Production Economics, 2000
- Efficient jobshop dispatching rules: Further developmentsProduction Planning & Control, 2000
- Deterministic job-shop scheduling: Past, present and futureEuropean Journal of Operational Research, 1999
- Guided Local Search with Shifting Bottleneck for Job Shop SchedulingManagement Science, 1998
- An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu searchAnnals of Operations Research, 1997
- An exchange heuristic imbedded with simulated annealing for due-dates job-shop schedulingEuropean Journal of Operational Research, 1996
- A genetic algorithm for job-shop problems with various schedule quality criteriaPublished by Springer Science and Business Media LLC ,1996
- Job shop scheduling with modified due datesJournal of Operations Management, 1983