Results 301 to 310 of about 51,211 (328)
Some of the next articles are maybe not open access.
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
1996
In this chapter we are going to consider scheduling tasks on dedicated processors or machines. We assume that tasks belong to a set of jobs, each of which is characterized by its own machine sequence. We will assume that any two consecutive tasks of the same job are to be processed on different machines. The type of factory layout is the job shop.
Jacek Błażewicz +4 more
openaire +1 more source
In this chapter we are going to consider scheduling tasks on dedicated processors or machines. We assume that tasks belong to a set of jobs, each of which is characterized by its own machine sequence. We will assume that any two consecutive tasks of the same job are to be processed on different machines. The type of factory layout is the job shop.
Jacek Błażewicz +4 more
openaire +1 more source
Annals of Operations Research, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +4 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +4 more sources
1997
Grob skizziert, besteht das Maschinenbelegungsproblem in der Werkstattproduktion darin, eine Auftragsreihenfolge fur Maschinen zu bestimmen und dabei die Startzeiten der Auftrage so festzulegen, das alle Restriktionen eingehalten werden und mindestens ein Ziel verfolgt wird. Ein solches Problem wird Job Shop-Problem genannt.
openaire +1 more source
Grob skizziert, besteht das Maschinenbelegungsproblem in der Werkstattproduktion darin, eine Auftragsreihenfolge fur Maschinen zu bestimmen und dabei die Startzeiten der Auftrage so festzulegen, das alle Restriktionen eingehalten werden und mindestens ein Ziel verfolgt wird. Ein solches Problem wird Job Shop-Problem genannt.
openaire +1 more source