Filters








811 Hits in 7.2 sec

A bicriteria approach to scheduling a single machine with job rejection and positional penalties

Dvir Shabtay, Nufar Gaspar, Liron Yedidsion
2010 Journal of combinatorial optimization  
Single machine scheduling problems have been extensively studied in the literature under the assumption that all jobs have to be processed.  ...  This paper provides a uni...ed bicriteria analysis of a large set of single machine problems sharing a common property: all problems can be represented by or reduced to a scheduling problem with a scheduling  ...  An instance for a single machine scheduling problem with job rejection is de…ned by the number of jobs to be processed, the jobs'processing times and rejection penalties.  ... 
doi:10.1007/s10878-010-9350-6 fatcat:zii5psuq3fd2vauzk4wngt2q5a

Scheduling with regular performance measures and optional job rejection on a single machine [article]

Baruch Mor, Dana Shapira
2018 arXiv   pre-print
We address single machine problems with optional jobs - rejection, studied recently in Zhang et al. [21] and Cao et al. [2].  ...  In these papers, the authors focus on minimizing regular performance measures, i.e., functions that are non-decreasing in the jobs completion time, subject to the constraint that the total rejection cost  ...  [9, 10] investigate scheduling a single machine with parallel batching to minimize makespan and total rejection cost, and improve algorithms for single machine scheduling with release dates and rejections  ... 
arXiv:1711.03720v2 fatcat:2boh3mk2bvbxtkohxwpnt45hfq

Modeling and solution methods for hybrid flow shop scheduling problem with job rejection

Mohamadreza Dabiri, Mehdi Yazdani, Bahman Naderi, Hassan Haleh
2021 Operational Research  
This paper addresses the hybrid flow shop scheduling problem by considering job rejection to minimize the sum of the total tardiness cost of the scheduled jobs and total cost of the rejected jobs as a  ...  As well as, in this paper, the problem is viewed from a bi-objective problem perspective, so that the tardiness costs of the scheduled jobs and rejection costs of rejected jobs as two objectives are minimized  ...  investigated a large number of problems associated with single-machine scheduling with the rejection to minimize the makespan plus the sum of the penalties of the jobs rejected.  ... 
doi:10.1007/s12351-021-00629-2 fatcat:33sxe5n7znhtxls3fnttt7dg5a

Single-machine scheduling under the job rejection constraint

Liqi Zhang, Lingfa Lu, Jinjiang Yuan
2010 Theoretical Computer Science  
In this paper, we consider single-machine scheduling problems under the job rejection constraint.  ...  A job is either rejected, in which case a rejection penalty has to be paid, or accepted and processed on the single machine.  ...  [6] considered the single-machine scheduling problem with rejection to minimize the sum of the weighted completion times of the accepted jobs and the total penalty of the rejected jobs.  ... 
doi:10.1016/j.tcs.2010.02.006 fatcat:2l2py4zpvzg6zpmry3nv6rxtty

Scheduling with Time-Dependent Processing Times

Yunqiang Yin, T. C. E. Cheng, Chin-Chia Wu
2014 Mathematical Problems in Engineering  
Steiner consider single-machine scheduling with learning/deterioration effects, time-dependent processing times, and due date assignment to minimize the weighted number of tardy jobs.  ...  Wan reviews the problem of scheduling deteriorating jobs on a single machine to minimize the makespan and provides a new fully polynomial-time approximation scheme for the problem.  ...  Steiner consider single-machine scheduling with learning/deterioration effects, time-dependent processing times, and due date assignment to minimize the weighted number of tardy jobs.  ... 
doi:10.1155/2014/201421 fatcat:dwsr4o2cvbafhmvn6jkhy3xgzm

Design and Comparison of Simulated Annealing Algorithm and GRASP to Minimize Makespan in Single Machine Scheduling with Unrelated Parallel Machines

Panneerselvam Sivasankaran, Thambu Sornakumar, Ramasamy Panneerselvam
2010 Intelligent Information Management  
This problem of minimizing the makespan in single machine scheduling problem with uniform parallel machines is NP hard. Hence, heuristic development for such problem is highly inevitable.  ...  In the first phase, the simulated annealing algorithm is presented and then GRASP (Greedy Randomized Adaptive Search procedure) is presented to minimize the makespan in the single machine scheduling problem  ...  Steps of GRASP to Minimize Makespan The steps of GRASP to minimize the makespan of the single machine scheduling problem with unrelated parallel machines are presented below.  ... 
doi:10.4236/iim.2010.27050 fatcat:aczlj2ljtfb5da4ltudrikesaa

Literature Review of Single Machine Scheduling Problem with Uniform Parallel Machines

Panneerselvam Senthilkumar, Sockalingam Narayanan
2010 Intelligent Information Management  
The single machine scheduling problem with uniform parallel machines consists of n jobs, each with single operation, which are to be scheduled on m parallel machines with different speeds.  ...  This paper presents a survey of single machine scheduling problem with uniform parallel machines.  ...  One can use Hodgson's algorithm to optimize the number of tardy jobs in the single machine scheduling problem with single processor with un-weighted jobs.  ... 
doi:10.4236/iim.2010.28056 fatcat:cugkndehgrgedbxdjuga7mz7e4

Order acceptance and scheduling: A taxonomy and review

Susan A. Slotnick
2011 European Journal of Operational Research  
Dósa and He (2006a) study preemptive and non-preemptive versions for online scheduling on two uniform machines with rejection, to minimize the sum of makespan and rejection penal ties.  ...  Lu et al. (2008) define the problem of unbounded parallel batch machines with rejection and release dates, with the objective of minimizing the sum of makespan of accepted orders and total rejection penalties  ... 
doi:10.1016/j.ejor.2010.09.042 fatcat:6xttqh2c4fhqjboou2tgffuary

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

M. B. Fakhrzad
2013 International Journal of Engineering  
The objectives are to minimize the makespan and sum of the earliness and tardiness of jobs in a time window.  ...  This paper presents a new multi-objective job shop scheduling with sequence-dependent setup times.  ...  Most studies of single-objective JSSP result in a schedule to minimize the time required to complete all jobs, i.e., to minimize the makespan.  ... 
doi:10.5829/idosi.ije.2013.26.02b.11 fatcat:azlm2xhzw5cmlggz3ajbnajqoq

Parallel Batch Scheduling of Deteriorating Jobs with Release Dates and Rejection

Juan Zou, Cuixia Miao
2014 The Scientific World Journal  
We consider the unbounded parallel batch scheduling with deterioration, release dates, and rejection.  ...  The objective is to minimize the sum of the makespan of the accepted jobs and the total penalty of the rejected jobs. First, we show that the problem is NP-hard in the ordinary sense.  ...  [19] studied the single machine scheduling with rejection to minimize the sum of the weighted completion times of the scheduled jobs and the total penalty of the rejected jobs. Shabtay et al.  ... 
doi:10.1155/2014/270942 pmid:25143969 pmcid:PMC4131089 fatcat:t7iuqe26fzdotem3e3p6fd5aba

A hybrid genetic local and global search algorithm for solving no-wait flow shop problem with bi criteria

Kenan Keskin, Orhan Engin
2021 SN Applied Sciences  
AbstractThis paper addresses the m-machine no-wait Flow Shop Scheduling with Setup Times (NW-FSSWST). Two performance measures: total flow time and makespan are considered.  ...  The objective is to find a sequence that minimizing total flow time ($$\sum C_{j}$$ ∑ C j ) and makespan ($$C_{j}$$ C j ) simultaneously.  ...  It can be seen in the literature review section, there is no published paper about the no-wait flow shop scheduling problem with setup times to minimizing total flow time and makespan simultaneously.  ... 
doi:10.1007/s42452-021-04615-3 fatcat:nvn62vpgzvaf7ivbemtc52cx7i

Pareto- Front Generation by Classical and Meta-heuristic Methods in Flexible Job Shop Scheduling with Multiple Objectives

Maryam Ghasemi, Ali Farzan
2017 International Journal of Computer Applications  
Finding optimal solutions are essential task in scheduling of jobs between machines in the industries.  ...  find Paretofronts: minimizing completion time of jobs and maximizing machine employment.  ...  The meta-heuristic approach in this paper uses NSGA-II to overcome scheduling problem with two parts of chromosomes (2p-NSGA II) in order to minimize Makespan with maximizing machines employment.  ... 
doi:10.5120/ijca2017913476 fatcat:xhnyp5gqizhiniuyj4a72onyi4

Dual Objective Task Scheduling Algorithm in Cloud Environment

Abdul Qadir O.S.
2020 International Journal of Advanced Trends in Computer Science and Engineering  
The objective of any scheduling algorithm is to reduce the makespan with proper utilization of resources.  ...  In this paper a new algorithm (DOTS) is developed with the realistic dual-objective criteria that minimize the makespan and balance the load across the resources.  ...  Now apply the WSM (multiplying and with their respective weights and adding them) to give the resultant single objective value for every scheduling technique. (7) Since both the objectives has been normalized  ... 
doi:10.30534/ijatcse/2020/07932020 fatcat:6n2se6i4yjghzll6eks2vv426y

Scheduling Simple Linear Deteriorating Jobs with Rejection

Juan Zou, Yuzhong Zhang
2014 Mathematical Problems in Engineering  
We consider the problems of scheduling deteriorating jobs with release dates on a single machine (parallel machines) and jobs can be rejected by paying penalties.  ...  For a single machine model, the objective is to minimize the maximum lateness of the accepted jobs plus the total penalty of the rejected jobs.  ...  The objectives are to minimize the makespan and the total weighted completion time plus the total penalty of the rejected jobs.  ... 
doi:10.1155/2014/170475 fatcat:xtp6535nvjgirdxnqsrwufkzpm

A new Nawaz–Enscore–Ham-based heuristic for permutation flow-shop problems with bicriteria of makespan and machine idle time

Weibo Liu, Yan Jin, Mark Price
2016 Engineering optimization (Print)  
A new tie-breaking rule is also introduced for achieving effective job insertion for the objective of minimizing both makespan and machine idle-time.  ...  A new Nawaz-Enscore-Ham-based heuristic for permutation flow-shop problem with bicriteria of makespan and machine idle-time.  ...  The most widely accepted objective is to minimize idle-time on the last machine with a makespan criterion.  ... 
doi:10.1080/0305215x.2016.1141202 fatcat:ifymhy7lv5atfjtgzy4m2g4odi
« Previous Showing results 1 — 15 out of 811 results