Results 251 to 260 of about 732,131 (298)
Some of the next articles are maybe not open access.
2016
This chapter studies a simple variant of the scheduling problem, namely job shop scheduling with unit-length tasks.
openaire +1 more source
This chapter studies a simple variant of the scheduling problem, namely job shop scheduling with unit-length tasks.
openaire +1 more source
2008
This chapter deals with multi operation models that are different from the flow shop models discussed in the previous chapter. In a flow shop model all jobs follow the same route. When the routes are fixed, but not necessarily the same for each job, the model is called a job shop. If a job in a job shop has to visit certain machines more than once, the
openaire +1 more source
This chapter deals with multi operation models that are different from the flow shop models discussed in the previous chapter. In a flow shop model all jobs follow the same route. When the routes are fixed, but not necessarily the same for each job, the model is called a job shop. If a job in a job shop has to visit certain machines more than once, the
openaire +1 more source
1999
Within the great variety of production scheduling problems that exist, the job shop scheduling problem (JSP) is one that has generated the largest number of studies. It has also earned a reputation for being notoriously difficult to solve. Nevertheless, the JSP illustrates at least some of the demands imposed by a wide array of real world scheduling ...
openaire +1 more source
Within the great variety of production scheduling problems that exist, the job shop scheduling problem (JSP) is one that has generated the largest number of studies. It has also earned a reputation for being notoriously difficult to solve. Nevertheless, the JSP illustrates at least some of the demands imposed by a wide array of real world scheduling ...
openaire +1 more source
General flow-shop and job-shop problems
1976In this chapter we consider general flow-shop and job-shop problems for which the number m of machines is variable. All these problems can be proved to be NP-complete from results in previous chapters; consequently the algorithms discussed in this chapter are mainly of the branch-and-bound type.
openaire +1 more source