Results 131 to 140 of about 22,096 (146)
Some of the next articles are maybe not open access.
Minimum makespan task sequencing with multiple shared resources
Robotics and Computer-Integrated Manufacturing, 2004Nel presente lavoro si studia lo scheduling nelle celle robotizzate in presenza di un braccio meccanico che deve eseguire operazioni di load, process e unload su macchine a controllo numerico. Viene studiata la complessità del problema quando l'obiettivo è la minimizzazione del tempo di completamento delle lavorazione relative ai pezzi nello shop.
CARAMIA M, DELL'OLMO, Paolo, ONORI R.
openaire +6 more sources
Makespan minimization in job shops
Proceedings of the thirty-first annual ACM symposium on Theory of Computing, 1999In this paper we present a polynomial time approximation scheme for the job shop scheduling problem with fixed number of machines and fixed number of operationsper job. The polynomial time approximation scheme can be extended to the case of job shop problems with release and delivery times, multiprocessor job shops, and dag job shops.
Solis-Oba, R. +2 more
openaire +2 more sources
Scheduling deteriorating jobs to minimize makespan
Naval Research Logistics, 1998Summary: We consider a single-machine problem of scheduling \(n\) independent jobs to minimize makespan, in which the processing time of job \(J_j\) grows by \(w_j\) with each time unit its start is delayed beyond a given common critical date \(d\). This processing time is \(p_j\) if \(J_j\) starts by \(d\). We show that this problem is NP-hard, give a
Kubiak, Wieslaw, van de Velde, Steef
openaire +2 more sources
Makespan distribution of permutation flowshop schedules
Journal of Scheduling, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jin, Feng +3 more
openaire +1 more source
Minimizing Makespan with Bimodal Processing Time Distributions
Management Science, 1981We consider the problem of scheduling n tasks on two identical parallel processors. Task i has a processing time of one time unit, but might have to undergo processing for a second time unit with probability pi, i.e., the processing time distributions of the tasks have mass only on one and on two.
openaire +2 more sources
Makespan Optimization in Open Shop Scheduling
2019In today’s rapid production scenario, scheduling plays a dynamic role in planning. In this work, open shop scheduling problem related to a copper flexible braids manufacturing company is considered. In a scheduling problem, the purpose is to find the orders of jobs on specific machines with an objective to optimize the makespan.
Prakash Kesarawani +2 more
openaire +1 more source
Stepwise Comparison for Minimizing Controller Makespan
2023 IEEE 13th International Conference on Control System, Computing and Engineering (ICCSCE), 2023Yuki Shimizu +3 more
openaire +1 more source