Filters








1,850 Hits in 7.8 sec

PROCESS PLANNING AND WEIGHTED SCHEDULING WITH WNOPPT WEIGHTED DUE-DATE ASSIGNMENT USING HYBRID SEARCH FOR WEIGHTED CUSTOMERS

Halil Ibrahim Demir, Ibrahim Cil, Ozer Uygun, Fuat Simsir, Abdullah Hulusi Kokcam
2017 MATTER International Journal of Science and Technology  
In this study integration of process planning and scheduling with weighted due date assignment is studied. Different level of integration of these three functions are tested.  ...  Although scheduling with due date assignment and, integrated process planning and scheduling are two popular topics studied by researchers, there are few works on integration of process planning, scheduling  ...  Acknowledgment This research is supported by the Sakarya University Scientific Research Projects Commission with project number 2016-01-02-002.  ... 
doi:10.20319/mijst.2016.s21.0119 fatcat:sn3xqzxnpvcwhiqsamrih3xe5y

Biogeography-based Optimization (BBO) Algorithm for Single Machine Total Weighted Tardiness Problem (SMTWTP)

Budi Santosa, Ade Lia Safitri
2015 Procedia Manufacturing  
Scheduling problem is one of popular combinatorial cases. One of the basic scheduling problem is Single Machine Total Weighted Tardiness Problem (SMTWTP).  ...  In this research, BBO is developed to solve a discrete problem such as SMTWTP. Based on experimental results, BBO is able to solve 57 out of 75 instances.  ...  Acknowledgement This research funding was supported by Directorate General of Higher Education of Indonesia.  ... 
doi:10.1016/j.promfg.2015.11.075 fatcat:6ngttcidzjclfiidl7t3o2t7cu

Minimizing Total Weighted Tardiness in a Generalized Job Shop

K. M. J. De Bontridder
2005 Journal of Scheduling  
As objective we consider the total weighted tardiness. We use a tabu search algorithm to search for the order in which the operations are processed on each machine.  ...  Given a sequence of operations on each machine, we determine optimal starting times by solving a maximum cost flow problem.  ...  The problem is to assign the operations to time intervals on the machines such that the schedule is feasible and the total weighted tardiness is minimized.  ... 
doi:10.1007/s10951-005-4779-7 fatcat:abc52pqh6fh23pua3zktih6oxu

Scheduling step-deteriorating jobs to minimize the total weighted tardiness on a single machine [article]

Peng Guo, Wenming Cheng, Yi Wang
2014 arXiv   pre-print
This paper addresses the scheduling problem of minimizing the total weighted tardiness on a single machine with step-deteriorating jobs.  ...  The introduction of step-deteriorating jobs makes a single machine total weighted tardiness problem more intractable.  ...  Acknowledgements This work is supported by the National Natural Science Foundation of China (No. 51405403) and the Fundamental Research Funds for the Central Universities (No. 2682014BR019).  ... 
arXiv:1411.0309v1 fatcat:jqqdbv46ena4zjid5hz4xe2mfe

Generating dispatching rules for semiconductor manufacturing to minimize weighted tardiness

Christoph Pickardt, Jurgen Branke, Torsten Hildebrandt, Jens Heger, Bernd Scholz-Reiter
2010 Proceedings of the 2010 Winter Simulation Conference  
The process of developing and adapting dispatching rules is currently a tedious, largely manual task.  ...  Coupling Genetic Programming (GP), a global optimization meta-heuristic from the family of Evolutionary Algorithms, with a stochastic discrete event simulation of a complex manufacturing system we are  ...  ACKNOWLEDGMENTS The authors would like to gratefully acknowledge funding from the German Research Council (DFG) under grant BR 1592/7-1 and SCHO 540/17-1.  ... 
doi:10.1109/wsc.2010.5678946 dblp:conf/wsc/PickardtBHHS10 fatcat:762j2lu23zhennzsiczlq7doxm

Minimal Total Weighted Tardiness in Tight-Tardy Single Machine Preemptive Idling-Free Scheduling

Vadim Romanuke
2019 Applied Computer Systems  
Two possibilities of obtaining the minimal total weighted tardiness in tight-tardy single machine preemptive idling-free scheduling are studied.  ...  Therefore, a heuristic based on remaining available and processing periods is used instead. The heuristic schedules 2 jobs always with the minimal tardiness.  ...  Further increment of jobs may delay obtaining the minimal TWT at least for a few minutes, but 7 jobs can still be scheduled at worst for 7 minutes.  ... 
doi:10.2478/acss-2019-0019 fatcat:e3oy4btxzffwje3b4yts5a3kwm

A Global Constraint for Total Weighted Completion Time [chapter]

András Kovács, J. Christopher Beck
2007 Lecture Notes in Computer Science  
We introduce a novel global constraint for the total weighted completion time of activities on a single unary capacity resource.  ...  Empirical results show that the proposed global constraint significantly improves the performance of constraint-based approaches to single-machine scheduling for minimizing the total weighted completion  ...  Acknowledgment A part of this work was carried out while A. Kovács was with the Cork Constraint Computation Centre, supported by an ERCIM fellowship.  ... 
doi:10.1007/978-3-540-72397-4_9 fatcat:md274yfcfbf6jmduivaudbfyfu

Minimizing Total Weighted Earliness and Tardiness for Parallel Batch-processing Machines with Incompatible Job Families

Pei-Chun WU, Ya-Chih TSAI, Hui-Mei Wang, Fuh-Der CHOU
2017 DEStech Transactions on Computer Science and Engineering  
Thus, in this paper we attempt to formulate a constrained programming model to find a schedule for minimizing the weighted earliness and tardiness.  ...  should not exceed the capacity limit of a machine.  ...  ) is to minimize the sum of weighted earliness and tardiness.  ... 
doi:10.12783/dtcse/aics2016/8237 fatcat:xoxyd6mopbdnrjrddqu3ny7sdq

Weighted Tardiness Minimization in Job Shops with Setup Times by Hybrid Genetic Algorithm [chapter]

Miguel A. González, Camino R. Vela, Ramiro Varela
2011 Lecture Notes in Computer Science  
In this paper we confront the weighted tardiness minimization in the job shop scheduling problem with sequence-dependent setup times.  ...  We start by extending an existing disjunctive graph model used for makespan minimization to represent the weighted tardiness problem.  ...  This research has been supported by the Spanish Ministry of Science and Innovation under research project MICINN-FEDER TIN2010-20976-C02-02 and by the Principality of Asturias under grant FICYT-BP07-109  ... 
doi:10.1007/978-3-642-25274-7_37 fatcat:egk7klfn6jdg3eqkebasojhprm

ACCURATE TOTAL WEIGHTED TARDINESS MINIMIZATION IN TIGHT-TARDY PROGRESSIVE SINGLE MACHINE SCHEDULING WITH PREEMPTIONS BY NO IDLE PERIODS

Vadim V. Romanuke
2019 KPI Science News  
Total weighted tardiness minimization in tight-tardy progressive single machine scheduling with preemptions by no idle periods can be sufficiently accurate by the heuristic if no less than 7 jobs divided  ...  The problem of minimization of total weighted tardiness can be solved either exactly by the corresponding models or heuristically.  ...  Problem statement In a way, there are a lot of types of the preemptive single machine scheduling problem with arbitrary release and due dates by equal processing periods.  ... 
doi:10.20535/kpi-sn.2019.5-6.178016 fatcat:qyn37rcjofgjtiqqmadgkibdym

An Augmented Lagrangian Approach for Scheduling Problems (Application to Total Weighted Tardiness Problems)

Tatsushi NISHI, Masami KONISHI
2005 JSME international journal. Series C, Mechanical systems, machine elements and manufacturing  
The paper describes an augmented Lagrangian decomposition and coordination approach for solving single machine scheduling problems to minimize the total weighted tardiness.  ...  The problem belongs to the class of NP-hard combinatorial optimization problem.  ...  Single-machine scheduling problem to minimize the total weighted tardiness is taken as an example problem.  ... 
doi:10.1299/jsmec.48.299 fatcat:vm4ee4nijja4nj7m4c2fqvx6o4

GRASP to minimize total weighted tardiness in a permutation flow shop environment

Lina Paola Molina-Sánchez, Eliana María González-Neira
2016 International Journal of Industrial Engineering Computations  
These are based on dynamic dispatching rules and also known for solving the problem of total weighted tardiness for single machine scheduling problem.  ...  Thus, this work intends to solve a PFS scheduling problem in order to minimize the total weighted tardiness, since it is an important sequencing criterion not only for on time delivery jobs but also for  ...  However since the objective function was to minimize total tardiness, so in order to minimize TWT; we need to generate the jobs weights (wj) for those instances.  ... 
doi:10.5267/j.ijiec.2015.6.004 fatcat:g23cvzrvwrgmjori3ewnmnl2re

Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness

Yumei Huo, Joseph Y.-T. Leung, Hairong Zhao
2007 European Journal of Operational Research  
We consider bi-criteria scheduling problems involving the maximum weighted tardiness and the number of tardy jobs.  ...  Consider a single machine and a set of jobs that are available for processing at time 0. Job ¡ has a processing time ¢ ¤ £ , a due date ¥ ¦ £ and a weight § £ .  ...  Computing facilities are provided by the PC Cluster Lab of the CS Department at NJIT, which is partially supported by NSF grant NSF-9977508 and partially supported by NJIT SBR grant SBR-421350.  ... 
doi:10.1016/j.ejor.2005.06.067 fatcat:zixuljd7djhfth3nxh4wzf5do4

Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates

Antoine Jouglet, David Savourey
2011 Computers & Operations Research  
where a set of n jobs J = {1, . . . , n} has to be processed on a set of m identical parallel machines M = {1, . . . , m} and where the objective is to minimize the total weighted tardiness.  ...  Machines cannot execute more than one job simultaneously. The tardiness of job i is defined as The problem is to find a feasible schedule with minimum total weighted tardiness.  ...  Acknowledgments The authors would like to thank Jacques Carlier for enlightening discussions on this problem. They also would like to thank the reviewers, whose remarks helped to improve this paper.  ... 
doi:10.1016/j.cor.2010.12.006 fatcat:adqty347abb3jowwpjao6alzae

Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions

Imed Kacem, Nizar Souayah, Mohamed Haouari
2012 Reserche operationelle  
This paper deals with the parallel-machine scheduling problem with the aim of minimizing the total (weighted) tardiness under the assumption of different release dates.  ...  We propose a branch-and-bound algorithm to solve the weighted and unweighted total tardiness.  ...  This work proposes an exact algorithm for the identical parallel-machine scheduling problem in order to minimize the total weighted tardiness with release dates.  ... 
doi:10.1051/ro/2012010 fatcat:ca4pgei42jg6xncpmvbnxq74ju
« Previous Showing results 1 — 15 out of 1,850 results