1,227 Hits in 4.9 sec

Complexity results for common due date scheduling problems with interval data and minmax regret criterion

Imed Kacem, Hans Kellerer
2019 Discrete Applied Mathematics  
We consider the problem of scheduling independent jobs with a common due date on a single machine with the objective of maximizing the number of early jobs.  ...  For measuring the quality of an algorithm for that problem with imprecise data we use the concept of minimizing the maximum regret. We present complexity results and some dominance properties.  ...  This research benefited from the support of the FMJH Program PGMO and from the support to this program from EDF-THALES-ORANGE.  ... 
doi:10.1016/j.dam.2018.09.026 fatcat:fzqqywwhvnd2pfhb4nva5zs5cm

Possibilistic Minmax Regret Sequencing Problems With Fuzzy Parameters

Adam Kasperski, Paweł Zielinski
2011 IEEE transactions on fuzzy systems  
First, the interval sequencing problems with the minmax regret criterion are discussed. The state of the art in this area is recalled.  ...  In particular, it is shown that every fuzzy problem can be efficiently solved if a polynomial algorithm for the corresponding interval problem with the minmax regret criterion is known.  ...  Namely, we discuss single-machine sequencing problems with the objective function of maximum lateness, maximum weighted tardiness, total flow time and weighted number of late jobs.  ... 
doi:10.1109/tfuzz.2011.2159982 fatcat:ziqgtmukpndy7llwvugsif24km

On Possibilistic Sequencing Problems with Fuzzy Parameters

Adam Kasperski, Pawel Zielinski
2009 European Society for Fuzzy Logic and Technology  
In this paper a wide class of sequencing problems with imprecise parameters is discussed.  ...  A possibilistic interpretation of fuzzy problems is provided, some solution concepts are proposed and some algorithms for computing the solutions are designed.  ...  Acknowledgment The second author was partially supported by Polish Committee for Scientific Research, grant N N111 1464 33.  ... 
dblp:conf/eusflat/KasperskiZ09a fatcat:7th7vc5qxnbmvjq4sajvlip52u

Hedging production schedules against uncertainty in manufacturing environment with a review of robustness and stability research

I. Sabuncuoglu, S. Goren
2009 International journal of computer integrated manufacturing (Print)  
In this paper, the major issues involved in scheduling decisions are discussed and the basic approaches to tackle these problems in manufacturing environments are analyzed.  ...  Scheduling is a decision-making process that is concerned with the allocation of limited resources to competing tasks (operations of jobs) over a time period with the goal of optimizing one or more objectives  ...  Kasperski (2004) studies robustness in a single machine environment with precedence constraints with maximum lateness criterion.  ... 
doi:10.1080/09511920802209033 fatcat:zb4xsuzlx5fdpomkuxwpkn5cw4

Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty [article]

Maciej Drwal
2017 arXiv   pre-print
We consider the class of single machine scheduling problems with the objective to minimize the weighted number of late jobs, under the assumption that completion due-dates are not known precisely at the  ...  It is assumed that only the intervals to which the due-dates belong are known. The concept of maximum regret is used to define robust solution.  ...  problem of permutation flow shop and parallel machines scheduling problem with the maximum makespan criterion.  ... 
arXiv:1708.03252v1 fatcat:47smcws4ynbs5hlh4vxsctwfd4

Robust min–max regret scheduling to minimize the weighted number of late jobs with interval processing times

Maciej Drwal, Jerzy Józefczyk
2019 Annals of Operations Research  
We consider the robust version of single machine scheduling problem with the objective to minimize the weighted number of jobs completed after their due-dates.  ...  The jobs have uncertain processing times represented by intervals, and decision-maker must determine their execution sequence that minimizes the maximum regret.  ...  Acknowledgements The authors are grateful to Wroclaw Centre for Networking and Supercomputing for granting access to the computing infrastructure built in the Projects No.  ... 
doi:10.1007/s10479-019-03263-6 fatcat:rbudhqxsojcrbe5naknsifogte

A survey of case studies in production scheduling: Analysis and perspectives

Helio Yochihiro Fuchigami, Socorro Rangel
2018 Journal of Computational Science  
This survey aims to highlight practical research and case studies published in the literature in the scheduling area, identifying the main characteristics of the problems treated, trends in this research  ...  The problems of production scheduling and sequencing refer to decision making regarding the designation of jobs to available resources and their subsequent order to optimize pre-defined performance measures  ...  first author's postdoctoral activities in the University of New South Wales, Australia.  ... 
doi:10.1016/j.jocs.2017.06.004 fatcat:esjzovlebbembdh4rqln3ugbw4

The robust single machine scheduling problem with uncertain release and processing times [article]

Nitish Umang, Alan L. Erera, Michel Bierlaire
2014 arXiv   pre-print
In this work, we study the single machine scheduling problem with uncertain release times and processing times of jobs.  ...  We adopt a robust scheduling approach, in which the measure of robustness to be minimized for a given sequence of jobs is the worst-case objective function value from the set of all possible realizations  ...  Kasperski (2005) studies the single machine scheduling problem for the absolute deviation measure of robustness, the maximum lateness performance criterion, and uncertainty intervals for the processing  ... 
arXiv:1411.7101v1 fatcat:4g765s53unberj5i64gse7hknm

Supply Chain Optimization Considering Sustainability Aspects

Mohammad Ali Beheshtinia, Parisa Feizollahy, Masood Fathi
2021 Sustainability  
To cope with the problem, it is mathematically formulated as a mixed-integer linear programming (MILP) model.  ...  The present study aims to tackle the supply chain scheduling problem in a DMS while considering two essential sustainability aspects, namely environmental and economic.  ...  Step 6: Calculate the maximum distance between each alternative and PIS in each criterion (Regret index) using Equation (23) .  ... 
doi:10.3390/su132111873 fatcat:qzxsbnrztngtdggfqhck4lrb3e

A Multicriteria Simheuristic Approach for Solving a Stochastic Permutation Flow Shop Scheduling Problem

Eliana Maria Gonzalez-Neira, Jairo R. Montoya-Torres, Jose-Fernando Jimenez
2021 Algorithms  
order to solve a multicriteria stochastic permutation flow shop problem with stochastic processing times and stochastic sequence-dependent setup times.  ...  An experimental design was carried out in several study instances of the flow shop problem to test the effects of the processing times and sequence-dependent setup times, obtained through lognormal and  ...  maximize throughput and minimize costs.  ... 
doi:10.3390/a14070210 fatcat:afrgpyt6cvfvtg6it74vcq5cpi

Integrated Production and Distribution Problem of Perishable Products with a Minimum Total Order Weighted Delivery Time

Liu, Liu
2020 Mathematics  
In this paper, an integrated production and distribution problem for perishable products is presented, which is an NP hard problem where a single machine, multi-customers, and homogenous vehicles with  ...  For comparison purposes, a genetic algorithm developed in a related problem is employed to solve this problem.  ...  In the production stage, a single machine is considered, and the order batching and the production sequence of the orders are determined.  ... 
doi:10.3390/math8020146 fatcat:s3zdlec2zrgkjosko43cmewcsi

Robustness and stability measures for scheduling: single-machine environment

Selcuk Goren, Ihsan Sabuncuoglu
2008 IIE Transactions  
The proposed surrogate measures, which consider both busy and repair time distributions, are embedded in a tabu-search-based scheduling algorithm, which generates schedules in a single-machine environment  ...  subject to machine breakdowns.  ...  is minimized (i.e., minimize maximum regret).  ... 
doi:10.1080/07408170701283198 fatcat:gwecwfyljrbirj4rghwha6c4hi

Optimization of schedule robustness and stability under random machine breakdowns and processing time variability

Selcuk Goren, Ihsan Sabuncuoglu
2009 IIE Transactions  
This paper takes a proactive scheduling approach to study scheduling problems with two sources of uncertainty: processing time variability and machine breakdowns.  ...  The ability to cope with uncertainty in the scheduling process is becoming an increasingly important issue.  ...  The authors offer a two-stage approach. In the first stage, a job sequence that will minimize the maximum lateness is determined. In the second stage, they insert idle times into the sequence.  ... 
doi:10.1080/07408170903171035 fatcat:winif7genzgwdohjqxal4fsnzm

A multi-objective supplier selection framework based on user-preferences

Federico Toffano, Michele Garraffa, Yiqing Lin, Steven Prestwich, Helmut Simonis, Nic Wilson
2021 Annals of Operations Research  
At each step, the framework optimally solves a combinatorial problem multiple times with different weights assigned to the objectives.  ...  Our experimental results also show the usability of the framework for real-world problems with respect to the execution time and the number of loops needed to achieve convergence.  ...  Acknowledgements This material is based on the works supported by the Science Foundation Ireland under Grant Nos. 12/RC/2289 and 12/RC/2289-P2 which are co-funded under the European Regional Development  ... 
doi:10.1007/s10479-021-04251-5 pmid:35035013 pmcid:PMC8724141 fatcat:sxuf6lhhebgphg4myybznbggoi

Flow-shop scheduling problem under uncertainties: Review and trends

Eliana María González-Neira, Jairo R. Montoya-Torres, David Barrera
2017 International Journal of Industrial Engineering Computations  
Flow-shop (FS) scheduling problems encompass the sequencing processes in environments in which the activities or operations are performed in a serial flow.  ...  The purpose of this paper is to provide a general overview of the FS scheduling problem under uncertainties and its role in production logistics and to draw up opportunities for further research.  ...  The objective is to construct a robust schedule according to a maximum tardiness criterion.  ... 
doi:10.5267/j.ijiec.2017.2.001 fatcat:ebefsxncxvdz3nazi327q4yuw4
« Previous Showing results 1 — 15 out of 1,227 results