Results 1 to 10 of about 221 (110)

Due-Window Assignment Scheduling with Variable Job Processing Times [PDF]

open access: yesThe Scientific World Journal, 2015
We consider a common due-window assignment scheduling problem jobs with variable job processing times on a single machine, where the processing time of a job is a function of its position in a sequence (i.e., learning effect) or its starting time (i.e ...
Yu-Bin Wu, Ping Ji
doaj   +2 more sources

Single Machine Scheduling and Due Date Assignment with Past-Sequence-Dependent Setup Time and Position-Dependent Processing Time [PDF]

open access: yesThe Scientific World Journal, 2014
This paper considers single machine scheduling and due date assignment with setup time. The setup time is proportional to the length of the already processed jobs; that is, the setup time is past-sequence-dependent (p-s-d).
Chuan-Li Zhao   +2 more
doaj   +2 more sources

Scheduling of Jobs with Multiple Weights on a Single Machine for Minimizing the Total Weighted Number of Tardy Jobs

open access: yesMathematics, 2023
We consider the scheduling of jobs with multiple weights on a single machine for minimizing the total weighted number of tardy jobs. In this setting, each job has m weights (or equivalently, the jobs have m weighting vectors), and thus we have m criteria,
Shuen Guo, Hao Lang, Hanxiang Zhang
doaj   +1 more source

The Due Date Assignment Scheduling Problem with Delivery Times and Truncated Sum-of-Processing-Times-Based Learning Effect

open access: yesMathematics, 2021
This paper considers a single-machine scheduling problem with past-sequence-dependent delivery times and the truncated sum-of-processing-times-based learning effect.
Jin Qian, Yu Zhan
doaj   +1 more source

Heuristic Dispatching Rules for Dynamic Scheduling of Heavy Engineering Equipments [PDF]

open access: yesEngineering and Technology Journal, 2012
Dynamic scheduling problem has been an attractive area for researches to investigate since a long time. Many techniques have been used to tackle such problems, but all of these techniques require high efforts to formulate the dynamic scheduling problems ...
Luma Adnan Al-Kindi   +2 more
doaj   +1 more source

An integrated model of scheduling, batch delivery and supplier selection in a make-to-order manufacturing system [PDF]

open access: yesDecision Science Letters, 2016
This paper analyzes a supply chain, which consists of a manufacturer, a retailer and several suppliers in which the retailer orders jobs to the manufacturer and the suppliers provide the requiring parts.
Mohammad Mahdavi Mazdeh   +2 more
doaj   +1 more source

Solving multi-objective Modified Distributed Parallel Machine and Assembly Scheduling Problem (MDPMASP) with eligibility constraints using metaheuristics

open access: yesProduction and Manufacturing Research: An Open Access Journal, 2022
We present a new generalization and metaheuristics for the distributed parallel machine and assembly scheduling problem (DPMASP), namely MDPMASP with eligibility constraints. There is a set of unrelated factories or production lines. Each has a series of
Ikhlasul Amallynda, Budi Santosa
doaj   +1 more source

An efficient parallel greedy algorithm for fuzzy hybrid flow shop scheduling with setup time and lot size: a case study in apparel process [PDF]

open access: yesJournal of Fuzzy Extension and Applications, 2022
This paper deals with the Fuzzy Hybrid Flow Shop (FHFS) scheduling inspired by a real apparel process. A Parallel Greedy (PG) algorithm is proposed to solve the FHFS problems with Setup Time (ST) and Lot Size (LS).
Orhan Engin, Meral İşler
doaj   +1 more source

Improve Algoritma Hodgson Untuk Meminimasi Jumlah Job Terlambat Pada Penjadwalan Flow shop

open access: yesJurnal Teknik Industri, 2018
Since Johnson published a paper in 1954, the problem of job scheduling has received the attention of hundreds of practitioners and researchers, as one of the most studied topics in Operation research.
Dian Setiya Widodo
doaj   +1 more source

Exact Solutions for Minimizing cost Function with Five Criteria and Release Dates on Single Machine

open access: yesIbn Al-Haitham Journal for Pure and Applied Sciences, 2020
     In this paper, we present a Branch and Bound (B&B) algorithm of scheduling (n) jobs on a single machine to minimize the sum total completion time, total tardiness, total earliness, number of tardy jobs and total late work with unequal release dates.
Hanan Ali Chachan   +1 more
doaj   +1 more source

Home - About - Disclaimer - Privacy