Due date ≈ Due date
View article
Unrelated Machine Scheduling with Stochastic Processing Times Open
Two important characteristics encountered in many real-world scheduling problems are heterogeneous processors and a certain degree of uncertainty about the processing times of jobs. In this paper we address both, and study for the first ti…
View article
A Decision Support System for Dynamic Job-Shop Scheduling Using Real-Time Data with Simulation Open
The wide usage of information technologies in production has led to the Fourth Industrial Revolution, which has enabled real data collection from production tools that are capable of communicating with each other through the Internet of Th…
View article
A robust just-in-time flow shop scheduling problem with outsourcing option on subcontractors Open
Scheduling is known as a great part of production planning in manufacturing systems. Flow Shop Scheduling (FSS) problem deals with the determination of the optimal sequence of jobs processing on machines in a fixed order. This paper addres…
View article
Single machine slack due window assignment and deteriorating jobs Open
In this paper, we investigate the minmax single-machine scheduling problem with the slack due window, where the actual processing time of a job is the deterioration function of its starting time. The goal is to obtain the optimal schedule …
View article
Weighted Tardiness Scheduling with Sequence-Dependent Setups: A Benchmark Library Open
This set of benchmark instances for the problem known as Weighted Tardiness Scheduling with Sequence Dependent Setups originated in 2003 as part of the Ph.D. Dissertation research of Vincent A. Cicirello from Carnegie Mellon University's R…
View article
An iterated local search for customer order scheduling in additive manufacturing Open
This paper studies the customer order scheduling problem in the context of additive manufacturing. The study discusses an integrated problem involving the nesting of parts as well as the scheduling of batches of nested parts onto unrelated…
View article
Research on position-dependent weights scheduling with delivery times and truncated sum-of-processing-times-based learning effect Open
This paper considers single-machine position-dependent weights scheduling problem with past-sequence-dependent delivery times and truncated sum-of-processing-times-based learning effect. The objective is to minimize the weighted sum of due…
View article
An Approach to Develop a Dynamic Job Shop Scheduling by Fuzzy Rule Based System and Comparative Study with the Traditional Priority Rules Open
This paper aims at developing a dynamic job shop scheduling by establishing fuzzy rule based system and comparing its effectiveness with the traditional priority rules. In order to understand the priorities of different jobs in a job shop,…
View article
Minimizing Total Earliness and Tardiness for Common Due Date Single-Machine Scheduling with an Unavailability Interval Open
This paper addresses the problem of schedulingindependent jobs on a single machine with a fixed unavailability interval, where the aim is to minimize the total earliness and tardiness (TET) about a common due date. Two exact methods are pr…
View article
A hybrid algorithm for unrelated parallel machines scheduling Open
In this paper, a new hybrid algorithm based on multi-objective genetic algorithm (MOGA) using simulated annealing (SA) is proposed for scheduling unrelated parallel machines with sequence-dependent setup times, varying due dates, ready tim…
View article
The Due Date Assignment Scheduling Problem with Delivery Times and Truncated Sum-of-Processing-Times-Based Learning Effect Open
This paper considers a single-machine scheduling problem with past-sequence-dependent delivery times and the truncated sum-of-processing-times-based learning effect. The goal is to minimize the total costs that comprise the number of early…
View article
Group Technology Scheduling with Due-Date Assignment and Controllable Processing Times Open
This paper investigates common (slack) due-date assignment single-machine scheduling with controllable processing times within a group technology environment. Under linear and convex resource allocation functions, the cost function minimiz…
View article
Minimizing Tardiness Penalty Costs in Job Shop Scheduling under Maximum Allowable Tardiness Open
In many manufacturing or service industries, there exists maximum allowable tardiness for orders, according to purchase contracts between the customers and suppliers. Customers may cancel their orders and request compensation for damages, …
View article
Mathematical models for a batch scheduling problem to minimize earliness and tardiness Open
Purpose: Today’s manufacturing facilities are challenged by highly customized products and just in time manufacturing and delivery of these products. In this study, a batch scheduling problem is addressed to provide on-time completion of c…
View article
Solving Integrated Process Planning, Dynamic Scheduling, and Due Date Assignment Using Metaheuristic Algorithms Open
Because the alternative process plans have significant contributions to the production efficiency of a manufacturing system, researchers have studied the integration of manufacturing functions, which can be divided into two groups, namely,…
View article
Scheduling with Communication Delays via LP Hierarchies and Clustering II: Weighted Completion Times on Related Machines Open
We consider the problem of scheduling jobs with precedence constraints on related machines to minimize the weighted sum of completion times, in the presence of communication delays. In this setting, denoted by Q | prec, c | ΣwjCj, if two d…
View article
Flexible Job Shop Scheduling Problem with Fuzzy Times and Due-Windows: Minimizing Weighted Tardiness and Earliness Using Genetic Algorithms Open
The current requirements of many manufacturing companies, such as the fashion, textile, and clothing industries, involve the production of multiple products with different processing routes and products with short life cycles, which preven…
View article
Solution algorithms for single-machine scheduling with learning effects and exponential past-sequence-dependent delivery times Open
This paper addresses the single-machine scheduling problem with learning effects and exponential past-sequence-dependent delivery times. The objective is to determine an optimal job schedule such that total weighted completion time and max…
View article
Delivery Times Scheduling with Deterioration Effects in Due Window Assignment Environments Open
In practical problems, in addition to the processing time of the job, the impact of the time required for delivering the service to customers on the cost is also considered, i.e., delivery time, where the job processing time is a simple li…
View article
Minimizing the Number of Tardy Jobs on Identical Parallel Machines Subject to Periodic Maintenance Open
This paper considers the problem of scheduling n independent jobs on m identical parallel machines in order to minimize the number of tardy jobs (ηT) considering the periodic preventive maintenance to avoid machine breakdowns. It assumes t…
View article
On the integration of due date setting and order release control Open
This paper calls for a paradigm shift in the production control literature away from assuming due date setting and order release are two independent decision levels. When order release is controlled, jobs do not enter the shop floor direct…
View article
Robust min–max regret scheduling to minimize the weighted number of late jobs with interval processing times Open
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…
View article
A computational evaluation of constructive heuristics for the parallel blocking flow shop problem with sequence-dependent setup times Open
This paper deals with the problem of scheduling jobs in a parallel flow shop environment without buffers between machines and with sequence-dependent setup times in order to minimize the maximum completion time of jobs. The blocking constr…
View article
Study on Single-Machine Common/Slack Due-Window Assignment Scheduling with Delivery Times, Variable Processing Times and Outsourcing Open
Single-machine due-window assignment scheduling with delivery times and variable processing times is investigated, where the variable processing time of a job means that the processing time is a function of its position in a sequence and i…
View article
A Two-Stage Assembly-Type Flowshop Scheduling Problem for Minimizing Total Tardiness Open
This research considers a two-stage assembly-type flowshop scheduling problem with the objective of minimizing the total tardiness. The first stage consists of two independent machines, and the second stage consists of a single machine. Tw…
View article
Integrated order acceptance and scheduling decision making in product service supply chain with hard time windows constraints Open
A product service supply chain (PSSC) supplies customers with product-service systems (PSS) consist of integrated products and services. The product manufacturing should match the service supply in the order delivery planning. For PSS orde…
View article
Earliness/tardiness minimization in a no-wait flow shop with sequence-dependent setup times Open
The no-wait flow shop scheduling problem (NWFSP) plays a crucial role in the allocation of resources in multitudinous industries, including the steel, pharmaceutical, chemical, plastic, electronic, and food processing industries. The NWFSP…
View article
Minimal Total Weighted Tardiness in Tight-Tardy Single Machine Preemptive Idling-Free Scheduling Open
Two possibilities of obtaining the minimal total weighted tardiness in tight-tardy single machine preemptive idling-free scheduling are studied. The Boolean linear programming model, which allows obtaining the exactly minimal tardiness, be…
View article
Minimizing the weighted number of tardy jobs on multiple machines: A review Open
We provide an overview of the history, the methods and the people who researched on minimizing the (weighted) number of tardy jobs as a performance measure. The review presents cases on multiple machines: parallel machines (including the i…
View article
Improving effectiveness of parallel machine scheduling with earliness and tardiness costs: A case study Open
This paper assesses the effectiveness in scheduling independent jobs with earliness/tardiness costs and variable setup times applying the Overall Equipment Effectiveness (OEE). The OEE is a common metric for measuring the manufacturing pro…