Zobrazeno 241 - 250
of 680
pro vyhledávání: '"Chu, Chengbin"'
Publikováno v:
[Research Report] RR-2495, INRIA. 1995, pp.19
The problem of scheduling n jobs on a single machine in order to minimize the weighted sum of earliness and tardiness in NP-complete when jobs have different due dates. In most of the papers dedicated to this problem, authors assume that there is no
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::cfa69265827ba1aa45dd29dc79ffd114
https://inria.hal.science/inria-00074180/document
https://inria.hal.science/inria-00074180/document
Publikováno v:
[Research Report] RR-2505, INRIA. 1995, pp.15
Lagrangian relaxation has recently emerged as an important method for solving complex scheduling problems. The technique has succeesfully been used to obtain near-optimal solutions for one machine scheduling problems and parallel machine scheduling p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::2011e2e65e26c6dd8bce88bb1088384c
https://hal.inria.fr/inria-00074173/file/RR-2505.pdf
https://hal.inria.fr/inria-00074173/file/RR-2505.pdf
Publikováno v:
[Research Report] RR-2496, INRIA. 1995, pp.26
This paper considers scheduling problems in a robotic cell which produces a set of parts on several machines served by a robot. We study the problem of sequencing parts in the cell in order to minimize the production cycle time when the sequence of t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::e3cc6aa5ec849a042639c0af55386bae
https://hal.inria.fr/inria-00074179
https://hal.inria.fr/inria-00074179
Publikováno v:
[Research Report] RR-2207, INRIA. 1994, pp.20
We consider a system the state of which is represented by the value of a unique variable. The state of the system can be observed at regular intervals of time. It evolves from one instant to the next one according to an exponential distribution. The
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::fb4cf7199e025914a9c65ff7dc99c9a8
https://hal.inria.fr/inria-00074464
https://hal.inria.fr/inria-00074464
Publikováno v:
[Research Report] RR-2307, INRIA. 1994, pp.19
This paper proposes a model and a related algorithm for generating optimal cyclic schedules of hoist moves with time window constraints in a printed circuit board (PCB) electroplating facility. The algorithm is based on the branch and bound approach
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::2a841048aeacccc42ea8a5f856a4c136
https://hal.inria.fr/inria-00074366
https://hal.inria.fr/inria-00074366
Autor:
Chu, Chengbin, Proth, Jean-Marie
Publikováno v:
[Research Report] RR-2268, INRIA. 1994, pp.16
We consider a single machine scheduling problem. This problem has been solved for a medical laboratory. It comprises not only chain-structured precedence constraints, but also minimal and maximal times separating successive jobs in the same chain. Th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::138e261dff19e06b55796c1676519ba1
https://hal.inria.fr/inria-00074403/file/RR-2268.pdf
https://hal.inria.fr/inria-00074403/file/RR-2268.pdf
Publikováno v:
[Rapport de recherche] RR-2186, INRIA. 1994, pp.37
Dans ce papier, nous examinons la conception des systèmes à événements discrets à l'aide des réseaux de Petri. Nous nous intéressons à la consistance, qui est une propriété souhaitée des systèmes à événements discrets. Nous mettons en
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::a57f2bd67a6afd66b17bf6286586a9a0
https://inria.hal.science/inria-00074485
https://inria.hal.science/inria-00074485
Publikováno v:
[Research Report] RR-2401, INRIA. 1994, pp.18
We consider a system composed of two independent and non-identical units. This system is under periodic inspection. Each unit is characterized by a variable whose value evolves from one inspection to the next one according to an exponential distribut
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::c0defef0afbab7bbc20cc9517749738e
https://hal.inria.fr/inria-00074274
https://hal.inria.fr/inria-00074274
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
[Research Report] RR-1929, INRIA. 1993, pp.17
A heuristic procedure is developed for minimizing makespan in flow-shop scheduling problems. In comparison with current algorithms, our algorithm seems to result in an improved makespan with a small additional computational effort. An algorithm is al
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::0bfff61ff864cd6f25f95f9cdcb3a5c6
https://inria.hal.science/inria-00074745/document
https://inria.hal.science/inria-00074745/document