Results 11 to 20 of about 1,045,429 (295)
Open Shop Scheduling with Synchronization [PDF]
Journal of Scheduling, 2017 In this paper, we study open shop scheduling problems with synchronization. This model has the same features as the classical open shop model, where each of the n jobs has to be processed by each of the m machines in an arbitrary order.
Chakhlevitch, NV +3 more
core +4 more sources
Open shop scheduling games [PDF]
European Journal of Operational Research, 2021 This paper takes a game theoretical approach to open shop scheduling problems with unit execution times to minimize the sum of completion times. By supposing an initial schedule and associating each job (consisting in a number of operations) to a different player, we can construct a cooperative TU-game associated with any open shop scheduling problem ...
Ata Atay, Pedro Calleja
exaly +4 more sources
The Open Shop Scheduling Problem [PDF]
, 2018 We discuss the computational complexity, the approximability, the algorithmics and the combinatorics of the open shop scheduling problem. We summarize the most important results from the literature and explain their main ideas, we sketch the most ...
Woeginger, Gerhard J.
core +4 more sources
IEEE Access, 2020 Open shop scheduling problems have many practical applications, in which the jobs can be in any order with the only restriction that their durations do not overlap with each other. In some cases, the order of a subset of jobs dictates the flow shop model
Guanqun Ni, Lei Chen
doaj +3 more sources
No-idle time Scheduling of Open shops: Modeling and Meta-heuristic Solution Methods [PDF]
International Journal of Supply and Operations Management, 2014 In some industries as foundries, it is not technically feasible to interrupt a processor between jobs. This restriction gives rise to a scheduling problem called no-idle scheduling.
Bahman Naderi, Vahid Roshanaei
doaj +3 more sources
Application of genetic algorithm to industrial scheduling and problems of parameters evaluation
Lietuvos Matematikos Rinkinys, 2021 Genetic algorithms are widely used in various mathematical and real world problems. They are approximate metaheuristic algorithms, commonly used for solving NP-hard problems in combinatorial optimisation.
Edgaras Šakurovas +1 more
doaj +1 more source
Dynamic MPC-Based Scheduling in a Smart Manufacturing System Problem
IEEE Access, 2023 This paper introduces a dynamic scheduling algorithm designed to minimize makespan within a smart manufacturing system, accommodating delays in the production process.
Alessandro Bozzi +3 more
doaj +1 more source
Analisis Preferensi Konsumen untuk Merancang Atribut Café dengan Menggunakan Metode Konjoin
Jurnal Teknik Industri: Jurnal Hasil Penelitian dan Karya Ilmiah dalam Bidang Teknik Industri, 2023 Perkembangan teknologi dan informasi mendorong bisnis di bidang makanan dan minuman menjadi makin kreatif. Kopi menjadi salah satu minuman yang disukai kalangan anak muda maupun orang tua.
Lilis Nurhayati, Agrienta Bellanov
doaj +1 more source
Perilaku pembelian impulsif remaja pengguna tiktok shop : Ditinjau dari mindfulness
Journal of Indonesian Psychological Science, 2023 : The shopping system has undergone changes and advancements, particularly with online shopping. Online shopping is considered time-saving and more efficient, leading to an increase in online stores offering attractive incentives such as free shipping ...
Savira Aprina Hardini +2 more
doaj +1 more source
Open shop scheduling with delays [PDF]
RAIRO - Theoretical Informatics and Applications, 1992 Summary: The concept of interprocessor delay is introduced on the open shop model. Delays are uniform if they are always the same for any job and between any pair of machines. Scheduling an open shop with uniform delays is shown to be NP-complete even for two machines.
Victor J. Rayward-Smith, Djamal Rebaine
openaire +2 more sources