Results 291 to 300 of about 51,211 (328)
Some of the next articles are maybe not open access.
IFAC Proceedings Volumes, 1989
Abstract A periodic version of the Job Shop Problem is presented, in which each task has to be repeated at a given rate in identical conditions. Constraints arising from job sequences, machine capacities, limited size of buffers and transportation times between machines are considered and their modelization is explained.
SERAFINI, Paolo, UKOVICH W.
openaire +2 more sources
Abstract A periodic version of the Job Shop Problem is presented, in which each task has to be repeated at a given rate in identical conditions. Constraints arising from job sequences, machine capacities, limited size of buffers and transportation times between machines are considered and their modelization is explained.
SERAFINI, Paolo, UKOVICH W.
openaire +2 more sources
Job Shop Scheduling With Deadlines
Journal of Combinatorial Optimization, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
BALAS E. +3 more
openaire +3 more sources
1992
The job shop scheduling problem is described as follows. Given are a set of jobs and a set of machines. Each machine can handle at most one job at a time. Each job consists of a chain of operations, each of which needs to be processed during an uninterrupted time period of a given length on a given machine.
openaire +1 more source
The job shop scheduling problem is described as follows. Given are a set of jobs and a set of machines. Each machine can handle at most one job at a time. Each job consists of a chain of operations, each of which needs to be processed during an uninterrupted time period of a given length on a given machine.
openaire +1 more source
International Journal of Production Economics, 1996
Abstract This paper discusses job shop scheduling from the viewpoint of dealing with fuzziness inherent in the problem. Some static problems with fuzzy information regarding due dates and/or operation times are solved using a branch-and-bound algorithm and the meaning of solving such scheduling problems is described.
Mitsuru Kuroda, Zeng Wang
openaire +1 more source
Abstract This paper discusses job shop scheduling from the viewpoint of dealing with fuzziness inherent in the problem. Some static problems with fuzzy information regarding due dates and/or operation times are solved using a branch-and-bound algorithm and the meaning of solving such scheduling problems is described.
Mitsuru Kuroda, Zeng Wang
openaire +1 more source
1996
Once the management requirements planning (MRP) system has projected a plan, the remaining task is to execute the plan. Through proper consideration of capacity, the evolving plan may be doable, but “doing it”—the execution— can be most challenging, especially in a job-shop environment. MRP was developed as a tool to assist in the complicated dependent
openaire +1 more source
Once the management requirements planning (MRP) system has projected a plan, the remaining task is to execute the plan. Through proper consideration of capacity, the evolving plan may be doable, but “doing it”—the execution— can be most challenging, especially in a job-shop environment. MRP was developed as a tool to assist in the complicated dependent
openaire +1 more source
Nursing Standard, 1993
Only 181 people have used the Clearing House set up to find jobs for redundant London nurses. And almost a quarter have rejected the posts which it says are suitable for them, with 21 per cent of employers turning down candidates selected by the initiative.
openaire +2 more sources
Only 181 people have used the Clearing House set up to find jobs for redundant London nurses. And almost a quarter have rejected the posts which it says are suitable for them, with 21 per cent of employers turning down candidates selected by the initiative.
openaire +2 more sources
The Quarterly Journal of Economics, 1978
I. Introduction, 261.—II. The basic model—risk neutrality, 262.—III. Mobility cost, 268.—IV. Education, 270.—V. Extensions of the basic model, 272.—VI. Empirical applications, 274.
openaire +2 more sources
I. Introduction, 261.—II. The basic model—risk neutrality, 262.—III. Mobility cost, 268.—IV. Education, 270.—V. Extensions of the basic model, 272.—VI. Empirical applications, 274.
openaire +2 more sources
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