processing times
JOB-SHOP SCHEDULING OPTIMIZATION WITH STOCHASTIC PROCESSING TIMES
... of processing times and routing characteristics. The processing time of each job on an equipment Phj is known as well as the due date for each job ...
11
Experimental-based simulated annealing for job shop scheduling problems with stochastic processing times
... job’s processing time is specific and known in advance have attracted considerable attention for several years ...fixed processing times, known jobs’ arrival times and/or unbreakable ...the ...
44
A Decomposition-Based Algorithm for Flexible Flow Shop Scheduling with Stochastic Processing Times
... stochastic processing times, the following assumptions are made: (1) Preemption is not allowed for job processing; (2) Each machine can process at most one operation at a time; (3) All jobs are ...
6
Branch and Bound Technique in Flow Shop Scheduling Using Fuzzy Processing Times
... fuzzy processing time of jobs. The fuzzy processing times are described by triangular membership ...of processing times, the obtained elapsed time is also a fuzzy ...
6
Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times
... (image processing programs, implemen- tations of heuristic algorithms) can be run partially, producing less precise ...with processing requirement p ( j ) can be split into a mandatory part which takes p ( ...
40
A submodular optimization approach to bicriteria scheduling problems with controllable processing times on parallel machines
... controllable processing times have been formulated in terms of maximization linear programming problems defined over special polyhedra with submodular ...the processing times of the ...
20
Preemptive scheduling on uniform parallel machines with controllable job processing times
... This paper is ideologically close to our previous work [20] in which several prob- lems with controllable processing times have been reduced to optimizing a linear objective function over a special ...
24
Heuristics For N Job M Machine Flowshop Batch Processing With Breakdown Times
... which for every job, the processing times of both operations are zero. Hence all of the jobs are ready for delivering to the customer at beginning. In such a case, because of the constant transportation ...
11
No Wait Flowshops to Minimize Total Tardiness with Setup Times
... The m-machine no-wait flowshop scheduling problem is addressed where setup times are treated as separate from processing times. The objective is to minimize total tardiness. Different dispatch- ing ...
8
Improving the receiving processes at Hamifleurs
... The processing times of step 1 will stay the same when changing the location of the receiving point of that ...The processing time of step 2 will change by changing the location of the receiving ...
142
Decentralized subcontractor scheduling with divisible jobs
... true processing time of each job to be a private information of its agent and we address the intricacies resulting from agents possibly lying by report- ing false processing times in order to obtain ...
15
A polynomial-time algorithm for a flow-shop batching problem with equal-length operations
... equal processing times and equal setup times, which is formulated as an integer non-linear programming problem of one variable k with a solution region given by the natural numbers not exceeding ...
35
FLEXIBLE SHARING IN DHT BASED P2P NETWORKS USING METADATA OF RESOURCE
... We consider the problem of common due window location scheduling on a single machine, where the processing times of jobs depend both on their starting times and positions in a sequence. The problem ...
6
A branch and bound for single machine stochastic scheduling to minimize the maximum lateness Pages 499-510 Download PDF
... This paper studies the problem of single machine stochastic scheduling with random processing times, deterministic due dates and an independent setup time. The jobs are also deteriorated based on the ...
12
Analyzing a few Heuristic Algorithms Considering Machine Idle Time and Processing Time in Permutation Flow Shop Scheduling Problems
... the processing time, machine idle time is also another important element in deciding the quality of the ...The processing times were drawn randomly as integers from a discrete uniform distribution ...
9
Scheduling with Proportional Linear Deteriorating and a Maintenance Activity
... The deteriorating (aging) effect on scheduling problem was first introduced by Brown and Yechiali[1]. Since then, scheduling problem with considerations of the deteriorating (aging) effects has been one of the most ...
5
Improving Chemotherapy Infusion Operations through the Simulation of Scheduling Heuristics.
... Lab processing times, the probability of waiting for chemotherapy orders, and the wait time for chemotherapy orders were modeled purely as a delay, which means increasing or decreasing this input parameter ...
83
Using simulation for a new production line at Philips Drachten
... all processing times, Times Till Failure, Times To Repair, ...constant processing times for most of the machines increases the complexity a ...
76
Behind the Times: Detecting Epoch Changes using Large Corpora
... Normalization. Due to the exponential growth of the published data, it is better to normalize the number of occurrences for a meaningful compari- son. We considered all the content nouns, includ- ing proper names, and we ...
9
"It Was the Best of Times and the Worst of Times"
... To some extent, these contrac tionary forces will be countered by the monetary stimulus that has been prOVid ed by the Federal Reserve, by lower in terest rates, and b[r] ...
5