JOBSHOP

JOBSHOP is a set of C programs for the job-shop scheduling problem. The codes are based on the paper ”A computational study of the job-shop scheduling problem” by David Applegate and William Cook (which appeared in ORSA Journal on Computing, Vol 3 No 2, 1991). The codes were written and tested on a variety of unix workstations in 1990. A set of test problems is included in the gzipped tarfile prob.tar.gz.


References in zbMATH (referenced in 80 articles , 1 standard article )

Showing results 1 to 20 of 80.
Sorted by year (citations)

1 2 3 4 next

  1. Talbi, El-Ghazali: Combining metaheuristics with mathematical programming, constraint programming and machine learning (2016)
  2. Grimes, Diarmuid; Hebrard, Emmanuel: Solving variants of the job shop scheduling problem through conflict-directed search (2015)
  3. Mencía, Carlos; Sierra, María R.; Varela, Ramiro: Depth-first heuristic search for the job shop scheduling problem (2013)
  4. Talbi, El-Ghazali: Combining metaheuristics with mathematical programming, constraint programming and machine learning (2013)
  5. González, Miguel Ángel; González-Rodríguez, Inés; Vela, Camino R.; Varela, Ramiro: An efficient hybrid evolutionary algorithm for scheduling with setup times and weighted tardiness minimization (2012)
  6. González, Miguel A.; Vela, Camino R.; Varela, Ramiro: A competent memetic algorithm for complex scheduling (2012)
  7. Roli, Andrea; Benedettini, Stefano; Stützle, Thomas; Blum, Christian: Large neighbourhood search algorithms for the founder sequence reconstruction problem (2012)
  8. Sels, Veronique; Craeymeersch, Kjeld; Vanhoucke, Mario: A hybrid single and dual population search procedure for the job shop scheduling problem (2011)
  9. Lin, Guolong; Rajaraman, Rajmohan: Approximation algorithms for multiprocessor scheduling under uncertainty (2010)
  10. Vela, Camino R.; Varela, Ramiro; González, Miguel A.: Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times (2010)
  11. Abdelmaguid, Tamer F.: Permutation-induced acyclic networks for the job shop scheduling problem (2009)
  12. Benoist, Thierry; Jeanjean, Antoine; Molin, Pascal: Minimum formwork stock problem on residential buildings construction sites (2009)
  13. Bidot, Julien; Vidal, Thierry; Laborie, Philippe; Beck, J.Christopher: A theoretic and practical framework for scheduling in a stochastic environment (2009)
  14. Buscher, Udo; Shen, Liji: An integrated tabu search algorithm for the lot streaming problem in job shops (2009)
  15. Carchrae, Tom; Beck, J.Christopher: Principles for the design of large neighborhood search (2009)
  16. Guerriero, F.: Hybrid rollout approaches for the job shop scheduling problem (2009)
  17. Hurkens, Cor A.J.: Incorporating the strength of MIP modeling in schedule construction (2009)
  18. Rego, César; Duarte, Renato: A filter-and-fan approach to the job shop scheduling problem (2009)
  19. Barreto, Ahilton; de O.Barros, Márcio; Werner, Cláudia M.L.: Staffing a software project: A constraint satisfaction and optimization-based approach (2008)
  20. Bouyer, Patricia; Brinksma, Ed; Larsen, Kim G.: Optimal infinite scheduling for multi-priced timed automata (2008)

1 2 3 4 next