• No results found

single machine tardy jobs problem

Minimizing the Number of Tardy Jobs on Single Machine Scheduling with Flexible Maintenance Time

Minimizing the Number of Tardy Jobs on Single Machine Scheduling with Flexible Maintenance Time

... study, single machine scheduling with flexible maintenance is investigated with non-resumable jobs by minimizing the weighted number of tardy ...the machine stops for a constant ...

17

A two-agent scheduling problem in a two-machine flowshop   Pages 289-306
		 Download PDF

A two-agent scheduling problem in a two-machine flowshop Pages 289-306 Download PDF

... deteriorating jobs. The objective of this problem was to minimize the total weighted number of tardy jobs of the first agent’s jobs subject to the condition that the maximum lateness of ...

18

Single machine parallel-batch scheduling with deteriorating jobs

Single machine parallel-batch scheduling with deteriorating jobs

... deteriorating jobs, where all jobs have a basic processing time equal to ...dedicated machine problems with deteriorating ...the problem of scheduling n jobs on a single ...

7

Hierarchical Minimization of Total Completion Time and Number of Tardy Jobs Criteria

Hierarchical Minimization of Total Completion Time and Number of Tardy Jobs Criteria

... the single criterion problems of minimizing the number of tardy jobs with release dates on a single machine (which is now the more important criterion in the bicriteria ...

5

A mathematical model for weighted tardy jobs scheduling problem with a batched delivery system   Pages 491-498
		 Download PDF

A mathematical model for weighted tardy jobs scheduling problem with a batched delivery system Pages 491-498 Download PDF

... weighted tardy jobs on a single machine when jobs are delivered to either customers or next station in various size ...completed jobs to deliver in batches may result in reducing ...

8

Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine

Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine

... scheduling problem in which the jobs are generated by two agents and have time-dependent proportional-linear deteriorating processing ...common single batching machine to process their ...

29

Online Full Text

Online Full Text

... lateness problem is NP-hard if the actual processing time is a linear function of its starting ...for single-machine problems of minimizing the makespan, maximum lateness, maximum cost and number of ...

6

Multi-criteria sequence-dependent single machine scheduling using genetic and simulated annealing algorithms

Multi-criteria sequence-dependent single machine scheduling using genetic and simulated annealing algorithms

... this single machine by trying to minimize downtime while respecting the different deadlines ...in single machine scheduling are very common. This type of problem is mathematically ...

6

A new mathematical model for single machine batch scheduling problem for minimizing maximum lateness with deteriorating jobs   Pages 253-264
		 Download PDF

A new mathematical model for single machine batch scheduling problem for minimizing maximum lateness with deteriorating jobs Pages 253-264 Download PDF

... the jobs are gathered before the process ...of single machine batching problem is strongly NP- hard for bounded and unbounded models and proposed two dynamic programming and a heuristic ...

12

An approximation algorithm and FPTAS for Tardy/Lost minimization with common due dates on a single machine

An approximation algorithm and FPTAS for Tardy/Lost minimization with common due dates on a single machine

... a single machine scheduling problem related to minimizing total Tardy/Lost penalties and common due ...The jobs have two common due dates, namely, and ...the Tardy/Lost objective ...

19

Study of Scheduling Problems with Machine Availability Constraint

Study of Scheduling Problems with Machine Availability Constraint

... the problem of finding a dynamically optimal policy to process n jobs on a single machine subject to stochastic preemptive-repeat-breakdowns (nonresumable ...of jobs to be random ...

24

A branch and bound algorithm to minimize the total weighted number of tardy jobs and delivery costs with late deliveries for a supply chain scheduling problem

A branch and bound algorithm to minimize the total weighted number of tardy jobs and delivery costs with late deliveries for a supply chain scheduling problem

... orders jobs to the manufacture and = ∑ # $% is the number of ...by single machine, with processing ...Processed jobs are delivered in batches to each customer. A batch can contain jobs ...

11

Energy Efficient Allocation for Cloud System Using Evolutionary Algorithm

Energy Efficient Allocation for Cloud System Using Evolutionary Algorithm

... We use Dynamic Power Management technique [4] to save energy consumption. At a time, the computer has two state: - Active status, which means that the computer is providing VMs to serve certain jobs. - Idle ...

5

A New Fuzzy Hybrid Dynamic Programming for Scheduling Weighted Jobs on Single Machine

A New Fuzzy Hybrid Dynamic Programming for Scheduling Weighted Jobs on Single Machine

... on single machine since time and memory restriction might be impossible or unfavorable, so this article recommends using local search heuristic algorithms as it has been tooled such Genetic Algorithm and ...

19

MINIMIZATION OF THE MAKE-SPAN USING DYNAMIC PROGRAMMING APPROACH IN A MOUKA FOAM COMPANY

MINIMIZATION OF THE MAKE-SPAN USING DYNAMIC PROGRAMMING APPROACH IN A MOUKA FOAM COMPANY

... Internally the company is pursuing its own programmes to ensuring that it is environmentally compliant, it also looks at corporate governance and socially responsible. So it is not just the environment, it is the whole ...

7

Heuristics For N Job M Machine Flowshop Batch Processing With Breakdown Times

Heuristics For N Job M Machine Flowshop Batch Processing With Breakdown Times

... parallel machine batching problems. He considers a scheduling problem in which n independent and simultaneously available jobs are to be processed on m identical parallel ...scheduling problem ...

11

Single-machine scheduling with deteriorating jobs and past-sequence-dependent setup times

Single-machine scheduling with deteriorating jobs and past-sequence-dependent setup times

... deteriorating jobs. Most research on scheduling with deteriorating jobs assumes that the actual processing time of a job is an increasing function of its starting ...where jobs are processed in ...

7

Parallel machines scheduling with applications to Internet ad-slot placement

Parallel machines scheduling with applications to Internet ad-slot placement

... the single slot mechanism with the budgets-only version of the multiple-slot ...the single-slot ...the single-slot case, we must be careful when a bidder enters the active set and suddenly causes an ...

69

Programme doctoral en recherche opérationnelle

Programme doctoral en recherche opérationnelle

... Abstract: Clip-Air is a new transportation system which introduces flexibility in various aspects of air transportation. In order to assess the potential advantages of Clip-Air we developed an integrated schedule design ...

6

Simultaneous selection and scheduling with sequence-dependent setup times, lateness penalties, and machine availability constraint: Heuristic approaches   Pages 147-160
		 Download PDF

Simultaneous selection and scheduling with sequence-dependent setup times, lateness penalties, and machine availability constraint: Heuristic approaches Pages 147-160 Download PDF

... several jobs or projects are put forward, a manufacturing company may logically tend to choose the ones which deliver the highest ...the jobs solely according to their revenues does not guarantee the ...

14

Show all 10000 documents...

Related subjects