In many basic scheduling models, jobs’ processing times and due-dates are deterministic. Practically, they are as uncertain variables in some more models. Furthermore, in a real situation of decision making, there exists uncertainty that can not be described only by fuzziness but also randomness. The purpose of this paper is to develop a methodology for parallel machines scheduling problem with...

In the last decade job shop scheduling problems have been subject to intensive research due to their multiple applications. Job shop scheduling is known as a strongly NPcomplete problem. In the job shop scheduling problems, processing times and due dates are very dynamically due to both human and machine resource factors. Fuzzy sets are used to model the uncertain processing times and due dates...

There are many real world problems in which parameters like the arrival time of new jobs, failure of resources, and completion time of jobs change continuously. This paper tackles the problem of scheduling jobs with random due dates on multiple identical machines in a stochastic environment. First to assign jobs to different machine centers LPT scheduling methods have been used, after that the ...

in this paper, a novel mathematical model for a preemption multi-mode multi-objective resource-constrained project scheduling problem with distinct due dates and positive and negative cash flows is presented. although optimization of bi-objective problems with due dates is an essential feature of real projects, little effort has been made in studying the p-mmrcpsp while due dates are included i...

in this study the location routing problem with fuzzy parameters is taken into account, this problem involves determining the location of the depots and routing of the vehicles in order to serve the customers. in this study a location routing problem with fuzzy travel times and due dates is considered and two objective models are proposed. the considered objectives are minimizing the total cost...

objective: in the colophon of every manuscript there is a date which indicates of the time when it has been written. sometimes these colophon dates change into another date through a slight manipulation. sometimes some dates have the potential of changing into another date, either because of passage of time or due to the scribe’s method of writing. this issue creates a problem for cataloguers, ...

Abstract This work addresses the scheduling of continuous single stage multiproduct plants with parallel units and shared storage tanks. Processing tasks are energy intensive and we consider timedependent electricity pricing and availability together with multiple intermediate due dates, handled as hard constraints. A new discrete-time aggregate formulation is proposed to rapidly plan the produ...

The scenario under consideration involves n cascaded continuous processing units responsible for processing m product lines. Each product line needs to be processed by all the units in the same sequence, and has dedicated finite capacity storage tanks before and after every processing unit. A unit can process only one product line at a time. Inputs for all the product lines arrive continuously ...

The goal of this paper is the development of a mixed integer programming formulation for the production planning and scheduling of parallel (single-stage) continuous processes in the presence of sequence-dependent switchover times and costs for product families, and sequence-independent switchovers for products belonging to the same family. Our formulation combines a discrete-time planning (big...