The quantity of carbon dioxide (CO2) emissions is one of the most widely recognised measures of environmental sustainability. Given the mounting concern about climate change and global warming, managers are facing growing pressure to reduce CO2 emissions. In practice, other than CO2 emissions, managers may be concerned with other objectives when making a scheduling decision. This work develops the ε-archived genetic algorithm (ε-AGA) to examine two batch scheduling problems with the goal of minimising CO2 emissions and the traditional due date-based objective of minimising total weighted tardiness (TWT). Experimental results show that in terms of both quality and diversity of solutions, ε-AGA outperforms NSGA-II for same computation time limit as the stopping criteria. Several interesting observations are made. (1) These two objectives conflict with each other; (2) jobs that arrive soon after each other reduce makespan, and so reduce CO2 emissions; (3) given a set of m identical batching machines, the due dates of jobs do not seem to substantially influence CO2 emissions; and (4) in purchasing a machine, the variation in power consumption among machines is critical to reducing the TWT.
In this study, several jobs make up a given customer order, and each job consists of a batch size greater than one, and nothing is delivered to the customer until the order is complete. Until delivery can be made, the completed jobs are to be stored in the inventory. In an order-based environment, scheduling is usually referred to as a customer order scheduling (COS) problem. The lot streaming (LS) technique is to split a processing job into several sub-jobs such that successive operations of the same job can be overlapped. LS has been shown to be an effective technique for compressing the mean lead time in a job-based environment, but has not been studied in the order-based environment. Therefore, this paper extends, for the first time, the applicability of LS to the COS problem, in order to investigate whether the expected benefits of LS can be observed in an order-based environment. To solve this complex problem, a genetic algorithm (GA) is applied to determine the LS conditions. The experiments led to the conclusion that our proposed algorithm (LS-GA) is significantly superior over the other LS modes in terms of makespan, lateness and finished goods (FG) flow time.
This paper investigates a new scheduling problem of multiple orders per job (MOJ) in a three-machine flowshop consisting of an item-processing machine, a lot-processing machine and a batch-processing machine, for a semiconductor manufacturing operation that must form a layer on the wafers. The three-machine flowshop MOJ scheduling problem deals with sequencing customer orders, assigning orders to jobs, and then combining the formed jobs into batches. Genetic algorithms are presented for this scheduling problem to minimise the total weighted tardiness (TWT), in the presence of non-zero order ready times, different order due dates, different order weights and unequal order sizes. Extensive experiments were performed to compare the proposed genetic algorithm (GA)-based approach with the benchmark heuristics presented in previous studies. The experiments led to the conclusions that the GA-based approach is significantly superior over other heuristics in terms of TWT and can find near-optimal solutions in an acceptable amount of computation time.