Scheduling Two Parallel Machines with Sequence-dependent Setups and A Single Server

January 2011
Gazi University Journal of Science;2011, Vol. 24 Issue 1, p113
Academic Journal
No abstract available.


Related Articles

  • A neural network algorithm for servicing jobs with sequential and parallel machines. Gholami, O.; Sotskov, Yu. // Automation & Remote Control;Jul2014, Vol. 75 Issue 7, p1203 

    We consider the FJ| C problem of optimal servicing with respect to performance for a given set of jobs by sequential and parallel machines. The problem FJ| C is a generalization of the classical J| C problem for the case when the servicing system has not only sequential but also parallel...

  • A Genetic Algorithm based Approach for Change Management in Enterprise IT Systems: Optimal Change Scheduling. Rehman, Habib-ur; Khan, Irshad // International Journal of Computer Applications;8/1/2012, Vol. 51, p38 

    In this paper, we provide a Genetic Algorithm (GA) based approach for change management in Enterprise IT systems which minimizes change delay and improves change capacity. Change management evolves the implementation of change queues on the set of applications which are running on one or more...

  • The impact of scheduling policies on the waiting-time distributions in polling systems. Bekker, R.; Vis, P.; Dorsman, J.; Mei, R.; Winands, E. // Queueing Systems;Feb2015, Vol. 79 Issue 2, p145 

    We consider polling models consisting of a single server that visits the queues in a cyclic order. In the vast majority of papers that have appeared on polling models, it is assumed that at each of the individual queues, the customers are served on a first-come-first-served (FCFS) basis. In this...

  • Copula-based Randomized Mechanisms for Truthful Scheduling on Two Unrelated Machines. Chen, Xujin; Du, Donglei; Zuluaga, Luis // Theory of Computing Systems;Oct2015, Vol. 57 Issue 3, p753 

    We design a Copula-based generic randomized truthful mechanism for scheduling on two unrelated machines with approximation ratio within [1.5852,1.58606], offering an improved upper bound for the two-machine case. Moreover, we provide an upper bound 1.5067711 for the two-machine two-task case,...

  • Evaluation of optimality in the fuzzy single machine scheduling problem including discounted costs. Bentrcia, Toufik; Mouss, Leila-Hayet; Mouss, Nadia-Kinza; Yalaoui, Farouk; Benyoucef, Lyes // International Journal of Advanced Manufacturing Technology;Sep2015, Vol. 80 Issue 5-8, p1369 

    The single machine scheduling problem has been often regarded as a simplified representation that contains many polynomial solvable cases. However, in real-world applications, the imprecision of data at the level of each job can be critical for the implementation of scheduling strategies....

  • A two-stage Ant Colony optimization algorithm to minimize the makespan on unrelated parallel machines-part II: enhancements and experimentations. Arnaout, Jean-Paul; Musa, Rami; Rabadi, Ghaith // Journal of Intelligent Manufacturing;Feb2014, Vol. 25 Issue 1, p43 

    In a previous paper (Arnaout et al in J Intell Manuf 21:693-701, ), an Ant Colony optimization (ACO I) algorithm was introduced for minimizing the schedule's makespan on unrelated parallel machines with sequence-dependent setup times. Optimal solutions for small instances of this problem were...

  • SOLVING THE JOB SHOP SCHEDULING PROBLEM WITH A PARALLEL AND AGENT-BASED LOCAL SEARCH GENETIC ALGORITHM. ASADZADEH, LEILA // Journal of Theoretical & Applied Information Technology;4/20/2014, Vol. 62 Issue 2, p317 

    Job shop scheduling problems play an important role in both manufacturing systems and industrial process for improving the utilization of resources, and therefore it is crucial to develop efficient scheduling technologies. The Job shop scheduling problem, one of the best known production...

  • About the convergence of reactive infinite order sudden calculations on parallel computers. Laganà, Antonio; Aguilar, Antonio; Gimenez, Xavier; Lucas, Jose’ M. // Journal of Chemical Physics;8/1/1991, Vol. 95 Issue 3, p2218 

    A problem of reactive infinite order sudden approximation calculations is the correct evaluation of the convergence of fixed angle contributions to the cross section with the reactant orbital quantum number l. Parallel computing, in addition to speeding up the calculation, offers the advantage...

  • Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions. Kacem, Imed; Souayah, Nizar; Haouari, Mohamed // RAIRO -- Operations Research;Apr2012, Vol. 46 Issue 2, p125 

    This paper deals with the parallel-machine scheduling problem with the aim of minimizing the total (weighted) tardiness under the assumption of different release dates. This problem has been proven to be NP-hard. We introduce some new lower and upper bounds based on different approaches. We...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics