• No results found

[PDF] Top 20 Minimizing Makespan with Start Time Dependent Jobs in a Two Machine Flow Shop

Has 10000 "Minimizing Makespan with Start Time Dependent Jobs in a Two Machine Flow Shop" found on our website. Below are the top 20 most common "Minimizing Makespan with Start Time Dependent Jobs in a Two Machine Flow Shop".

Minimizing Makespan with Start Time Dependent Jobs in a Two Machine Flow Shop

Minimizing Makespan with Start Time Dependent Jobs in a Two Machine Flow Shop

... the jobs in a forward manner starting from the first position. Each time, a branch is chosen and systematically worked down the searching tree until either it is fathomed by dominance rules and/or lower ... See full document

10

Minimizing makespan in a three-stage hybrid flow shop with dedicated machines   Pages 161-176
		 Download PDF

Minimizing makespan in a three-stage hybrid flow shop with dedicated machines Pages 161-176 Download PDF

... The two-machine flow shop problem is probably the first one to be successfully resolved, since Johnson (1954) proposed his well-known exact ...m-machine flow shop problem, ... See full document

16

Online Full Text

Online Full Text

... processing time is a linear function of its starting ...that minimizing the total weighted completion time is ...of minimizing the makespan, maximum lateness, maximum cost and number of ... See full document

6

Vol 3, No 9 (2012)

Vol 3, No 9 (2012)

... of jobs and the control of their flow through a production process is essential to modern production/manufacturing ...n jobs are to be scheduled on m machines in order to optimize some measures of ... See full document

8

A review of lot streaming in a flow shop environment with makespan criteria

A review of lot streaming in a flow shop environment with makespan criteria

... The methods used have been classified in exact and approximate, being the last type divided in meta-heuristics (Evolutionary and Non-evolutionary) and heuristics. As it is shown in Figure 1.1, for the simple case of ... See full document

10

A Hybrid Algorithm for Multi-Objective Optimization of Minimizing Makespan and Total Flow Time in Permutation Flow Shop Scheduling Problems

A Hybrid Algorithm for Multi-Objective Optimization of Minimizing Makespan and Total Flow Time in Permutation Flow Shop Scheduling Problems

... permutation flow shop scheduling, ‘n’ jobs must be processed on ‘m’ machines in the same Order se- ...all jobs. The permutation flow shop scheduling (PFSSP) has a broad ... See full document

11

Multi-objective sequence dependent setup times hybrid flowshop scheduling: A literature review

Multi-objective sequence dependent setup times hybrid flowshop scheduling: A literature review

... a two-level multi-start simulated annealing (TLMSA) heuristic with the objectives of simultaneously minimizing the makespan and the total flow time (or total ...the ... See full document

53

Novel Heuristics for no Wait Two Stage Multiprocessor Flow Shop with Probable Rework and Sequence Dependent Setup Times

Novel Heuristics for no Wait Two Stage Multiprocessor Flow Shop with Probable Rework and Sequence Dependent Setup Times

... no-wait two stage flexible flow shop scheduling problems with probable rework and sequence dependent setup times to minimizing ...of jobs and algorithm shows that AIWO in all of ... See full document

10

A hybrid algorithm for unrelated parallel machines scheduling   Pages 681-702
		 Download PDF

A hybrid algorithm for unrelated parallel machines scheduling Pages 681-702 Download PDF

... of minimizing makespan of the jobs in no-wait reentrant flow shop production ...parallel machine scheduling problems with release ...Permutation Flow Shop (PFS) ... See full document

22

Investigation of the two-machine flow shop scheduling problem to minimize total energy costs with time-dependent energy prices

Investigation of the two-machine flow shop scheduling problem to minimize total energy costs with time-dependent energy prices

... of two-machine flow shop scheduling to minimize total energy costs under time-of-use tariffs is ...considers two approaches, one for non-delay version of the problem and the ... See full document

16

Solving Re-entrant No-wait Flow Shop Scheduling Problem

Solving Re-entrant No-wait Flow Shop Scheduling Problem

... cycle time and flow time, and a heuristic for larger ...all jobs require the same time for each production step but have different due dates Qian et ...with two strategies for ... See full document

10

A hybrid algorithm for flexible job-shop scheduling problem with setup times

A hybrid algorithm for flexible job-shop scheduling problem with setup times

... n jobs must be processed on a set of m specified ...Job Shop problem (FJSP) is a generalization of the above-mentioned problem, where each operation can be processed by a set of resources and has a ... See full document

8

Multi-objective group scheduling with learning effect in the cellular manufacturing system   Pages 617-630
		 Download PDF

Multi-objective group scheduling with learning effect in the cellular manufacturing system Pages 617-630 Download PDF

... for two-machine flow shop assuming that the learning is applied for each machine, ...The two-machine flowshop problem was also considered in the context of group ... See full document

14

Specially structured n × 2 flow shop scheduling problem with jobs in a string of disjoint job blocks including transportation time

Specially structured n × 2 flow shop scheduling problem with jobs in a string of disjoint job blocks including transportation time

... some jobs must be scheduled ...a time. Langston (1987) gave heuristic solution to minimize makespan for a k-station flow shop problem where each station has a number of machines that ... See full document

6

A New Multi-objective Job Shop Scheduling with Setup Times Using a Hybrid Genetic Algorithm

A New Multi-objective Job Shop Scheduling with Setup Times Using a Hybrid Genetic Algorithm

... Job shop scheduling problem is seldom considered sequence-dependent setup times because SDST scheduling problem is more ...job shop with some assumptions, such as release and due dates, setup times ... See full document

12

Download
			
			
				Download PDF

Download Download PDF

... scheduling jobs in a no-wait flow shop with sequence-dependent setup times with the objective of minimizing the make span and the total flow ...present two new ... See full document

15

5. 	 Optimizing a multi-objectives flow shop scheduling problem by a novel genetic algorithm   Pages 345-354
		 Download PDF

5. Optimizing a multi-objectives flow shop scheduling problem by a novel genetic algorithm Pages 345-354 Download PDF

... no-wait flow-shop paradox and demonstrated that increasing the speed of some machines in a no-wait flow-shop instance may increase makespan, ...with two batching machines by ... See full document

10

Designing a Multi-Objective Mathematical Model for Flexible Job Shop Scheduling Problem With the Earliness/Tardiness Penalty

Designing a Multi-Objective Mathematical Model for Flexible Job Shop Scheduling Problem With the Earliness/Tardiness Penalty

... with two jobs, in which each operation had the same processing time in different ...a machine and processing time are assigned, and then for a number of operations, the alternative ... See full document

8

HEURISTIC APPROACH FOR BICRITERIA IN CONSTRAINED N X 2 FLOW SHOP SCHEDULING PROBLEM

HEURISTIC APPROACH FOR BICRITERIA IN CONSTRAINED N X 2 FLOW SHOP SCHEDULING PROBLEM

... 5 jobs, 2 machine flow shop problem with weights of jobs, processing time and setup time associated with their respective probabilities as given in t he following table ... See full document

20

An ant colony optimization-based algorithm for minimizing the makespan of a job shop problem

An ant colony optimization-based algorithm for minimizing the makespan of a job shop problem

... I also want to thank Pn. Shazirawati bt Mohd Puzi for helping with Latex, my examiners Assoc. Prof. Dr. Hjh. Rohanin bt Ahmad and Assoc. Prof. Dr. Leong Wah June for devoting their time to read my thesis and also ... See full document

26

Show all 10000 documents...