Results 11 to 20 of about 6,554,898 (191)

Dynamic resource constrained multi-project scheduling problem with weighted earliness/tardiness costs [PDF]

open access: yes, 2012
In this study, a conceptual framework is given for the dynamic multi-project scheduling problem with weighted earliness/tardiness costs (DRCMPSPWET) and a mathematical programming formulation of the problem is provided.
Ulusoy, Gündüz   +2 more
core   +2 more sources

Blocks for two-machines total weighted tardiness flow shop scheduling problem [PDF]

open access: yesBulletin of the Polish Academy of Sciences: Technical Sciences, 2020
The paper discusses a two-machine flow shop problem with minimization of the sum of tardiness costs, being a generalization of the popular NP-hard single-machine problem with this criterion. We propose the introduction of new elimination block properties
W. Bożejko, M. Uchroński, M. Wodecki
doaj   +1 more source

Minimizing total tardiness in a software developing company

open access: yesRevista Produção Online, 2013
Small companies in service sectors, such as software developers, usually rely on manual-based programming tasks. That programming yields satisfactory results for small task lists, but leads to managerial difficulties as a large number of tasks increases ...
Ícaro Ludwig   +2 more
doaj   +1 more source

A branch-and-bound algorithm to minimize total tardiness in a two-machine flowshop problem with different release time

open access: yesJournal of Advanced Mechanical Design, Systems, and Manufacturing, 2019
In this study, we consider the scheduling problem for two-machine flowshops with jobs of the different release times. In many real situations, jobs can be arrived at different times due to progress of jobs in the preceding stage or the status of supply ...
June-Young BANG, BongJoo JEONG
doaj   +1 more source

Comparison of the Effect of Various Types of Genetic Algorithm Operators on the Total Amount of Tardiness in Flow Shop Problem [PDF]

open access: yesمدیریت مهندسی و رایانش نرم, 2022
Flow Shop Scheduling Problem (FSSP) with the objective of minimizing total amount of tardiness is an NP-hard problem and many articles has been written about it.
Morteza Rasti Barzoki, Sajjad Raeisi
doaj   +1 more source

PENJADWALAN FLOWSHOP DENGAN MIXED INTEGER PROGRAMMING UNTUK MEMINIMASI TOTAL FLOWTIME DAN TOTAL TARDINESS

open access: yesJournal of Engineering and Management in Industrial System, 2015
Adi Bungsu (AB) Cigarette Company produces Clove Cigarette in four stages. Each stage is processed by one machine. Thus, the production line is described as flowshop. AB receive order from customer over country.
Ceria Farela Mada Tantrika
doaj   +1 more source

A Single Machine Scheduling Problem Considering Machine Availability Constraints

open access: yesShanghai Jiaotong Daxue xuebao, 2021
The study described in this paper is derived from a real rotor production workshop where low reliability leads to poor quality of workpieces. A single machine scheduling problem considering machine availability constraints is addressed.
WANG Jinfeng, CHEN Lu, YANG Wenhui
doaj   +1 more source

The Location-allocating Hub Problem with Direct Transportation Capability Considering Congestion and Tardiness Time in Hubs [PDF]

open access: yesمدیریت صنعتی, 2023
Objective: This paper seeks to find the optimal number of hubs and their location to keep the preparation time and congestion in the hubs and costs at a minimum. Also, this study considers the tardiness time for the conditions that the customer's need is
Pardis Roozkhosh   +1 more
doaj   +1 more source

Total Tardiness Minimization in a Single-Machine with Periodical Resource Constraints

open access: yesJurnal Optimasi Sistem Industri, 2022
In this paper we introduce a variant of the single machine considering resource restriction per period. The objective function to be minimized is the total tardiness.  We proposed an integer linear programming modeling based on a bin packing formulation.
Bruno Prata   +2 more
doaj   +1 more source

A size-reduction algorithm for the order scheduling problem with total tardiness minimization [PDF]

open access: yesJournal of Project Management, 2022
We investigated a variant of the customer order scheduling problem taking into consideration due dates to minimize the total tardiness. Since the problem under study is NP-hard, we propose an efficient size reduction algorithm (SR).
Stephanie Alencar Braga-Santos   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy