An Algorithm for Solving the Job-Shop Problem
Year of publication: |
1989
|
---|---|
Authors: | Carlier, J. ; Pinson, E. |
Published in: |
Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 35.1989, 2, p. 164-176
|
Publisher: |
Institute for Operations Research and the Management Sciences - INFORMS |
Subject: | job shop scheduling | branch-and-bound | computational experiments |
-
A branch-and-bound algorithm for the knapsack problem with conflict graph
Bettinelli, Andrea, (2017)
-
Exact approaches for the knapsack problem with setups
Furini, Fabio, (2018)
-
A new branch-and-filter exact algorithm for binary constraint satisfaction problems
San Segundo, Pablo, (2022)
- More ...
-
An algorithm for solving the job-shop problem
Carlier, J., (1989)
-
An O(n2) algorithm for time-bound adjustments for the cumulative scheduling problem
Carlier, J., (2020)
-
Jackson's Pseudo Preemptive Schedule for the Pm-ri, qi-Cmax scheduling problem
Carlier, J., (1998)
- More ...