๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the Job-Shop Scheduling Problem

โœ Scribed by Alan S. Manne

Book ID
123684350
Publisher
INFORMS
Year
1960
Tongue
English
Weight
181 KB
Volume
8
Category
Article
ISSN
0030-364X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Some new results on simulated annealing
Some new results on simulated annealing applied to the job shop scheduling problem
โœ M. Kolonko ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 256 KB

We present two results about heuristic solutions to the job shop scheduling problem (JSP). First, we show that the well-known analytical results on convergence of simulated annealing (SA) do not hold in the application to the JSP. We give a simple counterexample where the SA process converges agains

The open shop scheduling problem with a
The open shop scheduling problem with a given sequence of jobs on one machine
โœ Y.M. Shafransky; V.A. Strusevich ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 186 KB ๐Ÿ‘ 2 views

The paper considers the open shop scheduling problem to minimize the makespan, provided that one of the machines has to process the jobs according to a given sequence. We show that in the preemptive case the problem is polynomially solvable for an arbitrary number of machines. If preemption is not a