A new mathematical model for single machine batch scheduling problem for minimizing maximum lateness with deteriorating jobs

This paper presents a mathematical model for the problem of minimizing the maximum lateness on a single machine when the deteriorated jobs are delivered to each customer in various size batches. In reality, this issue may happen within a supply chain in which delivering goods to customers entails cost. Under such situation, keeping completed jobs to deliver in batches may result in reducing delivery costs. In literature review of batch scheduling, minimizing the maximum lateness is known as NP-Hard problem; therefore the present issue aiming at minimizing the costs of delivering, in addition to the aforementioned objective function, remains an NP-Hard problem. In order to solve the proposed model, a Simulation annealing meta-heuristic is used, where the parameters are calibrated by Taguchi approach and the results are compared to the global optimal values generated by Lingo 10 software. Furthermore, in order to check the efficiency of proposed method to solve larger scales of problem, a lower bound is generated. The results are also analyzed based on the effective factors of the problem. Computational study validates the efficiency and the accuracy of the presented model

Simple assembly line balancing problem under task deterioration

This paper introduces the effect of task deterioration in simple assembly line balancing problem. In many realistic assembly lines, a deterioration task is considered when a task is started earlier than the assigned time since the station time is constant and the earliness of the task does not reduce the cycle time. This phenomenon is known as deteriorating tasks. Therefore, we seek an optimal assignment and schedule of tasks in workstations, in order to minimize the number of stations for a given cycle time, which is known as SALBP-1. For this purpose, a mathematical model is proposed. Since the pure SALBP-1 is proved to be NP-hard and considering task deterioration complicates problem further, we propose a genetic algorithm for solving such problem. Several well-known test problems are solved to study the performance of the proposed approach

Single machine scheduling with general positional deterioration and rate-modifying maintenance

We present polynomial-time algorithms for single machine problems with generalized positional deterioration effects and machine maintenance. The decisions should be taken regarding possible sequences of jobs and on the number of maintenance activities to be included into a schedule in order to minimize the overall makespan. We deal with general non-decreasing functions to represent deterioration rates of job processing times. Another novel extension of existing models is our assumption that a maintenance activity does not necessarily fully restore the machine to its original perfect state. In the resulting schedules, the jobs are split into groups, a particular group to be sequenced after a particular maintenance period, and the actual processing time of a job is affected by the group that job is placed into and its position within the group

Stochastic single machine scheduling problem as a multi-stage dynamic random decision process

In this work, we study a stochastic single machine scheduling problem in which the features of learning effect on processing times, sequence-dependent setup times, and machine configuration selection are considered simultaneously. More precisely, the machine works under a set of configurations and requires stochastic sequence-dependent setup times to switch from one configuration to another. Also, the stochastic processing time of a job is a function of its position and the machine configuration. The objective is to find the sequence of jobs and choose a configuration to process each job to minimize the makespan. We first show that the proposed problem can be formulated through two-stage and multi-stage Stochastic Programming models, which are challenging from the computational point of view. Then, by looking at the problem as a multi-stage dynamic random decision process, a new deterministic approximation-based formulation is developed. The method first derives a mixed-integer non-linear model based on the concept of accessibility to all possible and available alternatives at each stage of the decision-making process. Then, to efficiently solve the problem, a new accessibility measure is defined to convert the model into the search of a shortest path throughout the stages. Extensive computational experiments are carried out on various sets of instances. We discuss and compare the results found by the resolution of plain stochastic models with those obtained by the deterministic approximation approach. Our approximation shows excellent performances both in terms of solution accuracy and computational time

A note on optimization in deteriorating systems using scheduling problems with the aging effect and resource allocation models

AbstractThis paper concerns scheduling problems with the aging effect and additional resource allocation. A measurable result of the aging phenomenon is that the time required to perform a job increases whereas the additional resource allocation allows one to decrease it. As an example of a deteriorating system that can be described and optimized by the application of the models and algorithms considered, we choose the pickling process, where cleaning of metal items decreases the efficiency of the pickling (cleaning) bath (i.e., one containing an active substance), whereas heating it up can improve the efficiency. In particular, we focus on the optimization problems for such systems and model them as single-machine scheduling problems with job processing times dependent on the fatigue of a machine and on the allocation of additional resources. The objectives considered are the minimization of time criteria (the maximum completion time and the maximum lateness) under a given resource consumption as well as the minimization of the resource consumption under given time criteria. The computational complexity of the problems is determined and solution properties are proved. On the basis of these, we construct optimal polynomial time algorithms for some cases of the problems considered

Human Aspect on Chain of Custody (CoC) System Performance

The tropical forests cover 24% of tropical land area. They are the most productive terrestrial ecosystems on earth with high priorities for biodiversity conservation. These forests store a substantial amount of carbon in biomass and soil, and they also regulate the transfer of carbon into the atmosphere as carbon dioxide (CO2). Indonesia is having the third tropical forest area in the world after Brazil and Congo. Over 50 years forest has been felled both legally as well as illegally. High rate of forest degradation resulted from unsustainable forest management, rampant illegal logging, forest area encroachment, conversion and natural disaster. All urges rapid improvement of management system of Indonesia’s forest resources (Holmes, 2002). Forest certification is one tool that can support the achievement of sustainable forest management goal. Under current operation of join certification protocol between the Forest Stewardship Council (FSC) and the Indonesian Ecolabelling Institute (LEI) in Indonesia, forest management units must be able to show the required performance indicated in LEI criteria and indicator as well as FSC principles and criteria to attain certification of their products. The gap between current practices and performance required by forest certifications schemes is still enormous. The performance of forest certification system from LEI is determined very much by the human that is involved in the process of planning and operation. The name of certification system is chain of custody (CoC) certification. CoC operation involves activities such as tracing raw material from the forest to the factory, through shipping and manufacturing, to the final end product. In all of the above processes, the roles of human are critical, although the specific roles played from one process to another are different. In this paper we present an identification of human aspect and other factors that predominantly affect CoC system performance

Condition-based maintenance—an extensive literature review

This paper presents an extensive literature review on the field of condition-based maintenance (CBM). The paper encompasses over 4000 contributions, analysed through bibliometric indicators and meta-analysis techniques. The review adopts Factor Analysis as a dimensionality reduction, concerning the metric of the co-citations of the papers. Four main research areas have been identified, able to delineate the research field synthetically, from theoretical foundations of CBM; (i) towards more specific implementation strategies (ii) and then specifically focusing on operational aspects related to (iii) inspection and replacement and (iv) prognosis. The data-driven bibliometric results have been combined with an interpretative research to extract both core and detailed concepts related to CBM. This combined analysis allows a critical reflection on the field and the extraction of potential future research directions