Results 91 to 100 of about 115,975 (208)

Flexible job shop scheduling problem in manufacturing [PDF]

open access: yes, 2013
This paper addresses a real assembly cell: the AIP-PRIMECA cell at the Université de Valenciennes et du Hainaut-Cambrésis, in France. This system can be viewed as a Flexible Job Shop, leading to the formulation of a Flexible Job Shop Scheduling Problem (
Barbosa, José   +3 more
core  

PEMAKAIAN ALGORITMA GENETIK UNTUK PENJADWALAN JOB SHOP DINAMIS NON DETERMINISTIK

open access: yesJurnal Teknik Industri, 2004
Dynamic Job shops non deterministic scheduling problem is concerned with ordering some operations that processed by certain machines with variable and unknown arrival time of jobs. When new jobs arrive, it requires modifications in the existing schedule.
Nico Saputro, Yento Yento
doaj  

Usulan Penjadwalan Job Shop Dengan Menggunakan Genetic Algorithms Pada PT Shima Prima Utama [PDF]

open access: yes, 2012
PT. Shima Prima Utama operate with Job Shop System. Job Shop scheduling for this company is a scheduling which use a lot of machines and a lot of operation with production type make to order.
., Handy
core  

Pull-Based Output Rate Control of a Flexible Job Shop in a Multi-Shop Production Chain

open access: yesMathematics
This paper addresses the problem where optimizing a single production shop within a production chain may not improve the overall performance of the entire chain.
Wei Weng, Meimei Zheng, Jiuchun Ren
doaj   +1 more source

The Impact of Processing Time Knowledge on Dynamic Job-Shop Scheduling [PDF]

open access: yes, 1989
The goal of this paper is to determine if the results for dynamic job-shop scheduling problems are affected by the assumptions made with regard to the processing time distributions and the scheduler's knowledge of the processing times.
Ou, Jihong, Wein, Lawrence M.
core  

Constraint monitoring in TOSCA [PDF]

open access: yes
The Job-Shop Scheduling Problem (JSSP) deals with the allocation of resources over time to factory operations. Allocations are subject to various constraints (e.g., production precedence relationships, factory capacity constraints, and limits on the ...
Beck, Howard
core   +1 more source

Realization of an Optimal Schedule for the Two-machine Flow-Shop with Interval Job Processing Times [PDF]

open access: yes, 2007
Non-preemptive two-machine flow-shop scheduling problem with uncertain processing times of n jobs is studied. In an uncertain version of a scheduling problem, there may not exist a unique schedule that remains optimal for all possible realizations of the
Leshchenko, Natalja, Sotskov, Yuri
core  

Home - About - Disclaimer - Privacy