Results 311 to 320 of about 680,167 (353)
An improved intelligent optimization algorithm for small-batch order production scheduling. [PDF]
Sci RepZhang X, Wang Z, Zhang D, Xu T, Jiang H.
europepmc +1 more source
Endorsing voice behavior can be as devastating as rejecting it when the endorsement is laced with a hint of anger. [PDF]
Sci RepGuzman FA +2 more
europepmc +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.
Jan Węglarz +4 more
openaire +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
2012 International Conference on Information Technology and e-Services, 2012
In this paper, we present a timed model called Resources Allocation Timed Automata (RATA), expressing parallel behaviors in natural way and supporting at the same time explicit action duration and shared resources. We show how the classical job-shop scheduling problem can be modeled naturally in RATA model, we present also two algorithms for finding ...
Farid, Arfi +2 more
openaire +3 more sources
In this paper, we present a timed model called Resources Allocation Timed Automata (RATA), expressing parallel behaviors in natural way and supporting at the same time explicit action duration and shared resources. We show how the classical job-shop scheduling problem can be modeled naturally in RATA model, we present also two algorithms for finding ...
Farid, Arfi +2 more
openaire +3 more sources
On transforming job-shops into flow-shops
Production Planning & Control, 2002In this paper the problem of transforming a job-shop environment into a flow-shop is addressed, where scheduling issues are simpler and pull production control systems might be easily applied. A linear programming model employing machine investment minimization as objective function is proposed.
Jose M. Framinan, Rafael Ruiz-Usano
openaire +2 more sources
Job-shop scheduling in a body shop
Journal of Scheduling, 2012We study a generalized job-shop problem called the body shop scheduling problem (BSSP). This problem arises from the industrial application of welding in a car body production line, where possible collisions between industrial robots have to be taken into account.
Joachim Schauer, Cornelius Schwarz
openaire +2 more sources
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 +3 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 +3 more sources
1997
The job shop scheduling problem (JSP) is a resource allocation problem where the resources are called machines. The problem involves finding an assignment (schedule) for a set of jobs to the machines so that the jobs can be completed “optimally.” Each job may consist of several tasks, and each task must be processed on a particular machine. Furthermore,
Edwin Hou, Nirwan Ansari
openaire +4 more sources
The job shop scheduling problem (JSP) is a resource allocation problem where the resources are called machines. The problem involves finding an assignment (schedule) for a set of jobs to the machines so that the jobs can be completed “optimally.” Each job may consist of several tasks, and each task must be processed on a particular machine. Furthermore,
Edwin Hou, Nirwan Ansari
openaire +4 more sources
International Journal of Production Research, 1981
Abstract The paper defines batch or job shop production and reviews the functions of production planning and production control in a job shop manufacturing situation. It argues that the separation of planning and control has resulted in the artificial isolation of the sequencing problem in job shop research.
B. J. Davies, J. E. Boonj, Jim Browne
openaire +2 more sources
Abstract The paper defines batch or job shop production and reviews the functions of production planning and production control in a job shop manufacturing situation. It argues that the separation of planning and control has resulted in the artificial isolation of the sequencing problem in job shop research.
B. J. Davies, J. E. Boonj, Jim Browne
openaire +2 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