Find link

language:

Find link is a tool written by Edward Betts.

searching for Job-shop scheduling 16 found (58 total)

Hyper-heuristic (2,522 words) [view diff] no match in snippet view article find links to article

re-discovered and extended several times during the 1990s. In the domain of Job Shop Scheduling, the pioneering work by Fisher and Thompson, hypothesized and experimentally

Philippe Baptiste (4,405 words) [view diff] exact match in snippet view article find links to article

Marta Flamini, Francis Sourd: Lagrangian bounds for just-in-time job-shop scheduling. Comput. Oper. Res. 35(3): 906-915 (2008) Antoine Jouglet, David

Jan Karel Lenstra (365 words) [view diff] no match in snippet view article find links to article

Peter J. M. van Laarhoven, Emile H. L. Aarts, Jan Karel Lenstra. - Job Shop Scheduling by Simulated Annealing (info) // Operations Research, 40 (1992)

Carla Gomes (665 words) [view diff] no match in snippet view article find links to article

global coherence by exploiting conflict : a distributed framework for job shop scheduling (PhD thesis). University of Edinburgh. hdl:1842/26842. OCLC 1064439468

Mark S. Fox (1,014 words) [view diff] exact match in snippet view article find links to article

1983 with the thesis "Constraint-directed search: a case-study of job-shop scheduling." Fox started his academic career at Carnegie Mellon University as

OR-Tools (468 words) [view diff] case mismatch in snippet view article find links to article

C. (2019). "Google vs IBM: A Constraint Solving Challenge on the Job-Shop Scheduling Problem". Electronic Proceedings in Theoretical Computer Science

David Applegate (355 words) [view diff] exact match in snippet view article find links to article

David; Cook, William (May 1991), "A computational study of the job-shop scheduling problem" (PDF), ORSA Journal on Computing, 3 (2): 149–156, doi:10

Egon Balas (694 words) [view diff] no match in snippet view article find links to article

Balas, J. Adams, D. Zawack: The Shifting Bottleneck Procedure for Job Shop Scheduling, Management Science 34, 1988; 391–401. E. Balas, V. Chvátal, J. Nesetril:

Henry Wallace Clark (1,093 words) [view diff] exact match in snippet view article find links to article

pp. 129–135 Jain, Anant Singh, and Sheik Meeran. "Deterministic job-shop scheduling: Past, present and future." European journal of operational research

Satish B. Rao (546 words) [view diff] exact match in snippet view article find links to article

542-567. F. T. Leighton, B. M. Maggs, and S. Rao, "Packet routing and job-shop scheduling in O(congestion + dilation) steps," Combinatorica, vol. 14, no. 2

Metaheuristic (3,195 words) [view diff] no match in snippet view article find links to article

problems. A typical representative of this combinatorial task class is job shop scheduling, which involves assigning the work steps of jobs to processing stations

Gur Mosheiov (713 words) [view diff] exact match in snippet view article find links to article

Research, 132, pp. 687–693. G. Mosheiov. (2002). The complexity of job-shop scheduling with deteriorating jobs. Discrete Applied Mathematics, 117, pp. 195–209

Laboratoire d'Automatique, Génie Informatique et Signal (305 words) [view diff] exact match in snippet view article find links to article

applied research such as optimal command for ironworks processes, job-shop scheduling and control for manufacturing systems in automobile industry and

Emma Hart (computer scientist) (1,027 words) [view diff] exact match in snippet view article

1007/978-3-319-10762-2_28 "A hyper-heuristic ensemble method for static job-shop scheduling". E.Hart, K.Sim. 2016. Evolutionary computation 24(4), 609-635. DOI:

Table of metaheuristics (3,453 words) [view diff] no match in snippet view article find links to article

(1998-02-01). "Guided Local Search with Shifting Bottleneck for Job Shop Scheduling". Management Science. 44 (2): 262–275. doi:10.1287/mnsc.44.2.262

Hopfield network (7,528 words) [view diff] exact match in snippet view article find links to article

function: Associative memory systems, Analog-to-Digital conversion, job-shop scheduling problem, quadratic assignment and other related NP-complete problems