Search

In this paper, we study the m-machine ( m ≥ 3 ) permutation flow shop scheduling in which the processing time of a job depends not only on the sum of actual processing times of previous jobs but also on its job-dependent truncation parameter, i.e., the general truncated learning effects. The goal is to find a sequence so as to minimize the makespan, we prove that this problem is NP-hard. Two simple heuristics are proposed and their worst-case bounds are presented. We also propose a branch-and-bound algorithm and some heuristics to solve this problem. Further, computational experiments are conducted to determine the efficiency of the proposed algorithms. [ABSTRACT FROM AUTHOR]

This paper deals with a single-machine scheduling problem with a general linear deterioration effect. The goal is to determine the job schedule such that the total weighted number of late jobs is minimized. We present three properties, one heuristic algorithm and a lower bound to speed up the search process of the branch-and-bound algorithm. In addition, some complex heuristics (including tabu search and simulated annealing algorithms) are proposed as solutions to this problem. The computational results show that the proposed algorithms are effective and efficient. [ABSTRACT FROM AUTHOR]

This paper discusses the single-machine scheduling problems with deteriorating jobs and past-sequence-dependent delivery times. Under the general deterioration function, the objective is to determine an optimal schedule for the job that minimizes the makespan, and the total weighted completion time. We demonstrate that the makespan minimization is polynomially solvable. For the total weighted completion time, this problem is NP-hard, to solve this problem, we provide the branch-and-bound algorithm and some heuristic algorithms. [ABSTRACT FROM AUTHOR]

In order to increase the efficiency of production in a deteriorating environment through competition amongst the individual agents, this study explores a two-agent scheduling problem with one deterioration rate for each job, where the processing time of a job is a function of the position-dependent workload, resource allocation, and deterioration rate (the range of the deterioration rate is non-negative). The optimal processing sequence and resource allocation for the jobs are found by giving an upper bound of an agent to minimize the maximum value of earliness, tardiness and decision variable of another agent under slack due-date assignment. It is verified that the problem cannot be solved in polynomial time, for which various heuristic algorithms and a branch-and-bound algorithm are proposed to simulate the data to find a better range in the deterioration rate parameter. [ABSTRACT FROM AUTHOR]

This paper studies the single machine scheduling problems with truncated logarithm processing times and exponential past-sequence-dependent delivery times. We prove that the makespan and total completion time minimizations are polynomially solvable. For the total weighted completion time minimization, we illustrate that it remains polynomially solvable under a special case; under the general case, this paper proposes heuristic, tabu search and branch-and-bound algorithms. Computational experiments indicate that the heuristic algorithm is more effective than tabu search algorithm. [ABSTRACT FROM AUTHOR]

This paper addresses the single-machine scheduling with general truncated learning effects (GTLE) and delivery times that are past sequence dependent (DT psd) . The objective is to determine an optimal job schedule such that makespan, sum of the β th power of job completion times, and total weighted completion time are minimized, where β > 0 is a given constant. We proved that the makespan, the sum of the β th power of job completion times, and a special case of the total weighted completion time can be solved in polynomial time. For the general case of the total weighted completion time, we propose the heuristic, simulated annealing and branch-and-bound algorithms. Extensive numerical experiments validate the efficiency of the proposed solution algorithms on a set of randomly generated instances. Furthermore, the computational experiment is also conducted to show that the simulated annealing performs effectively and efficiently. [ABSTRACT FROM AUTHOR]

This article studies the single-machine scheduling problem with due date assignments, deteriorating jobs, and past-sequence-dependent delivery times. Under three assignments (i.e., common, slack, and different due dates), the goal is to determine a feasible sequence and due dates of all jobs in order to minimize the weighted sum of earliness, tardiness, and due date costs of all jobs, where the weight is not related to the job but to the position in which some job is scheduled. Through a series of optimal properties, efficient and fast polynomial time algorithms are designed for solving the studied scheduling problem with three due date assignments. [ABSTRACT FROM AUTHOR]

This paper addresses single-machine scheduling problems with truncated learning effects. The objective is to determine the optimal job schedule such that the makespan, the total weighted completion time and the maximum lateness are to be minimized. All the considered problems are NP-hard; hence, for each problem, we propose the heuristic and branch-and-bound algorithms. Extensive numerical experiments validate the efficiency of the proposed solution algorithms on a set of randomly generated instances. [ABSTRACT FROM AUTHOR]

In a recent paper, Jiang et al. (Eng Optim 52(1):37–52, 2020) considered proportionate flowshop scheduling with position-dependent weights. For common and slack due-date assignment problems, they proved that both of these two problems can be solved in O (n 2 log n) time, where n is the number of jobs. The contribution of this paper is that we show that these two problems can be optimally solved by a lower-order algorithm, i.e., in O (n log n) time. [ABSTRACT FROM AUTHOR]

This article studies scheduling problems with past-sequence-dependent delivery times (denoted by psddt) on a single-machine, i.e., the delivery time of a job depends on its waiting time of processing. We prove that the total (discounted) weighted completion time minimization can be solved in O (n log n) time, where n is the number of jobs, and the weight is a position-dependent weight. For common (denoted by con) and slack (denoted by slk) due-date assignment and position-dependent weights (denoted by pdw), we prove that an objective cost minimization is solvable in O (n log n) time. The model (i.e., psddt and pdw) can also be extended to position-dependent (time-dependent) processing times. [ABSTRACT FROM AUTHOR]

This paper addresses flow shop scheduling problems with sum-of-logarithm-processing-times-based learning effects. The objective is to minimize the total completion time, the makespan, the total weighted completion time, and the sum of the quadratic job completion times, respectively. Heuristic algorithms based on the optimal schedules for the corresponding flow shop scheduling problems are presented and their worst-case error bounds are also analyzed. [ABSTRACT FROM AUTHOR]

This paper considers a scheduling problem with general job-dependent learning curves and controllable processing times on a single machine. The objective is to determine the optimal compressions of the processing times and the optimal sequence of jobs so as to minimize some total cost functions, which consist of regular and non-regular functions and the processing time compressions. It shows that the problem can be solved by an assignment problem and thus can be solved in polynomial time. Some extensions of the problem are also given. [ABSTRACT FROM AUTHOR]

Scheduling with general truncated job-dependent learning effect and resource-dependent processing times is studied on a single machine. It is assumed that the job processing time is a function of the amount of resource allocated to the job, the general job-dependent learning effect and the job-dependent control parameter. For each version of the problem that differs in terms of the objective functions and the processing time functions, the optimal resource allocation is provided. Polynomial time algorithms are also developed to find the optimal schedule of several versions of the problem. [ABSTRACT FROM AUTHOR]

The focus of this paper is to analyze unrelated parallel-machine resource allocation scheduling problem with learning effect and deteriorating jobs. The goal is to find the optimal sequence of jobs and the optimal resource allocation separately for minimizing the cost function including the total load, the total completion time, the total absolute deviation of completion time and the total resource cost. We show that the problem is polynomial time solvable if the number of machines is a given constant. [ABSTRACT FROM AUTHOR]

We consider a single machine due date assignment scheduling problem with job-dependent aging effects and a deteriorating maintenance activity, where due dates are assigned using the SLK due date determination method. We need to make a decision on when to schedule the deteriorating maintenance activity, the optimal common flow allowance and the sequence of jobs to minimize total earliness, tardiness and common flow allowance cost. We show that the problem remains polynomially solvable under the proposed model. [ABSTRACT FROM AUTHOR]

In this paper we consider the single machine scheduling problems with sum-of-logarithm-processing-times based and position based learning effects, i.e., the actual job processing time of a job is a function of the sum of the logarithms of the processing times of the jobs already processed and its position in a sequence. The logarithm function is used to model the phenomenon that learning as a human activity is subject to the law of diminishing return. We show that even with the introduction of the proposed model to job processing times, several single machine problems remain polynomially solvable. [ABSTRACT FROM AUTHOR]

In this paper we consider the single machine scheduling problem with truncated job-dependent learning effect. By the truncated job-dependent learning effect, we mean that the actual job processing time is a function which depends not only on the job-dependent learning effect (i.e., the learning in the production process of some jobs to be faster than that of others) but also on a control parameter. The objectives are to minimize the makespan, the total completion time, the total absolute deviation of completion time, the earliness, tardiness and common (slack) due-date penalty, respectively. Several polynomial time algorithms are proposed to optimally solve the problems with the above objective functions. [ABSTRACT FROM AUTHOR]

In this paper we consider the single machine scheduling problem with truncated exponential learning functions. By the truncated exponential learning functions, we mean that the actual job processing time is a function which depends not only on the total normal processing times of the jobs already processed but also on a control parameter. The use of the truncated function is to model the phenomenon that the learning of a human activity is limited. We show that even with the introduction of the proposed model to job processing times, several single machine problems remain polynomially solvable. For the following three objective functions, the total weighted completion time, the discounted total weighted completion time, the maximum lateness, we present heuristic algorithms according to the corresponding problems without truncated exponential learning functions. We also analyse the worst-case bound of our heuristic algorithms. [ABSTRACT FROM AUTHOR]

In this paper, we consider a two-machine flow shop scheduling problem with decreasing linear deterioration. By decreasing linear deterioration, we mean that the processing time is a decreasing function of its execution start time. The objective is to find a sequence that minimizes the total weighted completion time. Several dominance properties and some lower bounds are derived to speed up the elimination process of a branch-and-bound algorithm. Two heuristic algorithms are also proposed to overcome the inefficiency of the branch-and-bound algorithm. Computational results for randomly generated problem instances are presented. [ABSTRACT FROM AUTHOR]

We consider a two-machine flow shop scheduling problem with effects of deterioration and learning. By the effects of deterioration and learning, we mean that the processing time of a job is a function of its execution starting time and its position in a sequence. The objective is to find a sequence that minimizes the makespan. Several dominance properties and two lower bounds are derived, which are used to speed up the elimination process of a branch-and-bound algorithm proposed to solve the problem. Two heuristic algorithms are also proposed to obtain near-optimal solutions. Computational results are presented to evaluate the performance of the proposed algorithms. [ABSTRACT FROM AUTHOR]

The aim of our study is to investigate the relationship between neuropsychiatric systemic lupus erythematosus (NPSLE) development and clinical factors to elucidate potential predictors at the time of SLE onset as well as during NP flares. Sixty-seven adolescents between the ages of 10 and 18 years with SLE were retrospectively reviewed, and their clinical characteristics and laboratory findings were analyzed. Twenty-four (35.82%) patients with NPSLE were included in the analysis. Renal involvement at the time of SLE onset was significantly less common in patients who developed NP symptoms ( P = 0.0038), but renal involvement during the entire follow-up (FU) period was not significantly different between patients with NP and those without NP. Photosensitivity at the time of SLE diagnosis was significantly more common in patients with NP ( P = 0.0080). No differences were found in the clinical and laboratory results between the time of SLE onset and NP onset in the same late-onset NP group. Our results suggest that NP development is negatively correlated with renal involvement at the onset of SLE, but not during the entire FU period, and NP development is positively correlated with photosensitivity at the time of SLE onset. We could not identify any factors that might predict the occurrence of NP symptoms during an NP flare. [ABSTRACT FROM AUTHOR]

Sarcoidosis with osseous involvement as the initial manifestation is rare. Due to lack of other organ involvements, the diagnosis is somehow difficult to establish. We report a case with osseous sarcoidosis as the initial and major manifestation that developed spontaneous bone fracture. Our case emphasizes the importance of histological evidence and exclusion of other diseases i.e. rheumatoid arthritis, before making the diagnosis of osseous sarcoidosis. [ABSTRACT FROM AUTHOR]

In this paper we investigate a single machine scheduling problem with deteriorating jobs and group technology assumption. By deteriorating jobs and group technology assumption, we mean that job processing times are simple linear functions of its starting times. The group setup times are assumed to be known and fixed. We attempt to minimize the makespan with ready times of the jobs. For a special case, we show that the problem can be solved in polynomial time when deterioration and group technology are considered simultaneously. [ABSTRACT FROM AUTHOR]

In this paper, we consider the single-machine scheduling problems with nonlinear deterioration. By the nonlinear deterioration effect, we mean that the processing times of jobs are nonlinear functions of their starting times. We show that even with the introduction of nonlinear deterioration to job processing times, single machine makespan minimization problem remains polynomially solvable. We also show that an optimal schedule of the total completion time minimization problem is V-shaped with respect to job normal processing times. A heuristic algorithm utilizing the V-shaped property is proposed, and computational experiments show that it performs effectively and efficiently in obtaining near-optimal solutions. [ABSTRACT FROM AUTHOR]

A real industrial production phenomenon, referred to as learning effects, has drawn increasing attention. However, most research on this issue considers only single machine problems. Motivated by this limitation, this paper considers flow shop scheduling problems with a general position-dependent learning effects. By the general position-dependent learning effects, we mean that the actual processing time of a job is defined by a general non-increasing function of its scheduled position. The objective is to minimize one of the five regular performance criteria, namely, the total completion time, the makespan, the total weighted completion time, the total weighted discounted completion time, and the sum of the quadratic job completion times. We present heuristic algorithms by using the optimal permutations for the corresponding single machine scheduling problems. We also analyze the worst-case bound of our heuristic algorithms. [ABSTRACT FROM AUTHOR]

This paper deals with single-machine scheduling problems with a more general learning effect based on sum-of-processing-time. In this study, sum-of-processing-time-based learning effect means that the processing time of a job is defined by a decreasing function of the total normal processing time of jobs that come before it in the sequence. Results show that even with the introduction of the sum-of-processing-time-based learning effect to job processing times, single-machine makespan minimization problems remain polynomially solvable. The curves of the optimal schedule of a total completion time minimization problem are V-shaped with respect to job normal processing times. [ABSTRACT FROM AUTHOR]

We consider single machine scheduling problems in which the processing time of a job depends on its position in a processing sequence. The objectives are to minimize the weighted sum of completion times, to minimize the maximum lateness and to minimize the number of tardy jobs. For some special cases, we prove that the weighted shortest processing time (WSPT) rule, the earliest due date (EDD) rule and Moore’s algorithm can construct an optimal sequence for these objective functions, respectively. For the general cases, we also give the worst-case bound of these three rules. [ABSTRACT FROM AUTHOR]

In this paper we consider the flow shop scheduling problems with the effects of learning and deterioration. In this model the processing times of a job is defined as a function of its starting time and position in a sequence. The scheduling objective functions are makespan and total completion time. We prove that even with the introduction of learning effect and deteriorating jobs to job processing times, some special flow shop scheduling problems remain polynomially solvable. [ABSTRACT FROM AUTHOR]

This paper considers single machine scheduling problems with group technology (GT) and deteriorating jobs. A sequence independent setup is required to process a job from a different group and jobs in each group are processed together. We consider the case of jobs whose processing times are a decreasing function of their starting time. The objectives of scheduling problems are to minimize the makespan and the total completion time, respectively. We also provide polynomial time algorithms to solve these problems. [ABSTRACT FROM AUTHOR]

In this paper, we consider single machine SLK due date assignment scheduling problem in which job processing times are controllable variables with linear costs. The objective is to determine the optimal sequence, the optimal common flow allowance and the optimal processing time compressions to minimize a total penalty function based on earliness, tardiness, common flow allowance and compressions. We solve the problem by formulating it as an assignment problem which is polynomially solvable. For some special cases, we present an O( n log n) algorithm to obtain the optimal solution respectively. [ABSTRACT FROM AUTHOR]

The paper is devoted to some flow shop scheduling problems, where job processing times are defined by functions dependent on their positions in the schedule. An example is constructed to show that the classical Johnson's rule is not the optimal solution for two different models of the two-machine flow shop scheduling to minimize makespan. In order to solve the makespan minimization problem in the two-machine flow shop scheduling, we suggest Johnson's rule as a heuristic algorithm, for which the worst-case bound is calculated. We find polynomial time solutions to some special cases of the considered problems for the following optimization criteria: the weighted sum of completion times and maximum lateness. Some furthermore extensions of the problems are also shown. [ABSTRACT FROM AUTHOR]

In this paper we study the no-wait or no-idle permutation flowshop scheduling problem with an increasing and decreasing series of dominating machines. The objective is to minimize one of the five regular performance criteria, namely, total weighted completion time, maximum lateness, maximum tardiness, number of tardy jobs and makespan. We establish that these five cases are solvable by presenting a polynomial-time solution algorithm for each case. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to point out that the jobs in the scheduling problem considered in Yin et al. (Int J Adv Manuf Technol 46:707-714, ) may not be deteriorating jobs. [ABSTRACT FROM AUTHOR]