نتایج جستجو برای: machine scheduling

تعداد نتایج: 325168  

Journal: :Tsinghua Science and Technology 2006

Journal: :Journal of the Operations Research Society of Japan 1986

Journal: :European Journal of Operational Research 2009
T. C. Edwin Cheng Bertrand M. T. Lin

Two-machine flowshop scheduling to minimize makespan is one of the most well-known classical scheduling problems. Johnson's rule for solving this problem has been widely cited in the literature. We introduce in this paper the concept of composite job, which is an artificially constructed job with processing times such that it will incur the same amount of idle time on the second machine as that...

1996
Carsten Jordan

We consider a single-machine scheduling problem with a multi-level product structure. Setups are required if the machine changes production from one product type to another, and the scheduling decision must satisfy dynamic demand. We propose a lotsizing as well as a scheduling model, and we compare solution procedures for both models on a small set of instances. The multi-level structure compli...

Journal: :Math. Oper. Res. 2005
Nicole Megow Marc Uetz Tjark Vredeveld

We consider a model for scheduling under uncertainty. In this model, we combine the main characteristics of online and stochastic scheduling in a simple and natural way. Job processing times are assumed to be stochastic, but in contrast to traditional stochastic scheduling models, we assume that jobs arrive online, and there is no knowledge about the jobs that will arrive in the future. The mod...

2006
Tzung-Pei Hong Pei-Ying Huang Gwoboa Horng

In simple flow shop problems, each machine operation center includes just one machine. If at least one machine center includes more than one machine, the scheduling problem becomes a flexible flow-shop problem. Recently, group scheduling has also been proposed and discussed. In the group scheduling, each job belongs to a specific group and all the jobs are processed group by group. In this pape...

Journal: :Math. Program. 2007
Alexander Grigoriev Maxim Sviridenko Marc Uetz

We consider several parallel machine scheduling settings with the objective to minimize the schedule makespan. The most general of these settings is unrelated parallel machine scheduling. We assume that, in addition to its machine dependence, the processing time of any job is dependent on the usage of a scarce renewable resource. A given amount of that resource, e.g. workers, can be distributed...

2014
David C. Wyld Mohammed Saeed Al-kahtani

Scheduling the active and idle period of machine type communication devices (MTC) such as RFID tags, sensors and smart meters are significantly important to achieve energy efficiency in the emerging machine to machine (M2M) communication networks, which comprises thousands of resource constrained MTC devices (i.e., low data rate, energy and bandwidth). However, only a few studies exist in the l...

2011
Güvenç Şahin Ravindra K. Ahuja

We study a scheduling problem that belongs to the yard operations component of the railroad planning problems, namely the hump sequencing problem. The scheduling problem is characterized as a single-machine problem with stepwise tardiness cost objectives. This is a new scheduling criterion which is also relevant in the context of traditional machine scheduling problems. We produce complexity re...

Journal: :CoRR 2015
Davide Giglio

Four lemmas, which constitute the theoretical foundation necessary to determine optimal control strategies for a class of single machine family scheduling problems, are presented in this technical report. The scheduling problem is characterized by the presence of sequence-dependent batch setup and controllable processing times; moreover, the generalized due-date model is adopted in the problem....

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید