Zobrazeno 1 - 10
of 15
pro vyhledávání: '"H.A.J. Crauwels"'
Publikováno v:
The Open Operational Research Journal. 4:12-24
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cd7a0252ce67ff0d3c29f08e62064417
https://doi.org/10.2174/1874243201004010012
https://doi.org/10.2174/1874243201004010012
Publikováno v:
Production Planning & Control. 20:649-663
Sheet metal working remains an important industry. It is argued that, to be competitive, the complete production chain needs to be optimised. Therefore, this article focuses on the optimisation of the production plan. The sheet metal shop is configur
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::318fe977482e6156f3e488296c857322
https://doi.org/10.1080/09537280903034354
https://doi.org/10.1080/09537280903034354
Publikováno v:
Production Planning & Control. 16:514-525
Air bending is a forming process by which very complicated three-dimensional parts are produced on a press brake. A bending operation is performed on a station consisting of a punch and a die. A part is produced by performing a sequence of bending op
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::39d13cd554de4b52e43ad18f9d0cd89d
https://doi.org/10.1080/09537280500159141
https://doi.org/10.1080/09537280500159141
Publikováno v:
Journal of Scheduling. 8:161-177
This paper considers the problem of scheduling a single machine to minimize the number of late jobs in the presence of sequence-independent family set-up times. The jobs are partitioned into families, and a set-up time is required at the start of eac
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a9b5507dea626466661a5fe14c8a3a04
https://doi.org/10.1007/s10951-005-6365-4
https://doi.org/10.1007/s10951-005-6365-4
Publikováno v:
Annals of Operations Research. 83:59-76
This paper presents several branch and bound algorithms for a single-machine scheduling problem with batching. Jobs are partitioned into families, and a set-up time is necessary when there is a switch from processing jobs of one family to jobs of ano
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::08e35b3490d271259dbf03abb6183e0a
https://doi.org/10.1023/a:1018920416308
https://doi.org/10.1023/a:1018920416308
Publikováno v:
Annals of Operations Research. 70:261-279
Local search heuristics are developed for a problem of scheduling a single machine to minimize the total weighted completion time. The jobs are partitioned into families, and a set-up time is necessary when there is a switch in processing jobs from o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::43cd6ce0fb166d5c4ea80589786208c3
https://doi.org/10.1023/a:1018978322417
https://doi.org/10.1023/a:1018978322417
Publikováno v:
European Journal of Operational Research. 90:200-213
Local search heuristics are developed for a problem of scheduling jobs on a single machine. Jobs are partitioned into families, and a set-up time is necessary when there is a switch in processing jobs from one family to jobs of another family. The ob
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::717a13ec01887bfeafb9730d8f7a9dde
https://doi.org/10.1016/0377-2217(95)00349-5
https://doi.org/10.1016/0377-2217(95)00349-5
Publikováno v:
Multiprocessor Scheduling, Theory and Applications
Sheet metal operations have been in existence since 8000 B.C. (Fries-Knoblach, 1999). Due to its long history, sheet metalworking is, unfortunately, often seen as archaic and uninteresting. That metal sheets can be transformed with the aid of robust
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::970088e7631ddbadfaba5604bd2c25cc
https://doi.org/10.5772/5231
https://doi.org/10.5772/5231
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.
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.