Improving construction and demolition waste collection service in an urban area using a simheuristic approach: A case study in Sydney, Australia

This paper provides a comprehensive survey of research on operating room planning and scheduling problems. Aiming to give a comprehensive classification on the studied problems, we review the literature from the perspectives of decision level, scheduling strategy, patient characteristics, problem setting, uncertainty, mathematical models, and solutions and methods. The papers are reviewed in diversified ways so as to obtain a detailed overview in this area, and the fields that need to be focused on are summarized. It shows that mathematical programming and heuristics are frequently applied in the complex linear and combinatorial optimization problems. Furthermore, future research trends and directions on operating room planning and scheduling are also identified.

Operating room planning and surgical case scheduling: a review of literature

In this article, we propose a hybrid artificial bee colony (ABC) algorithm to solve a parallel batching distributed flow-shop problem (DFSP) with deteriorating jobs. In the considered problem, there are two stages as follows: 1) in the first stage, a DFSP is studied and 2) after the first stage has been completed, each job is transferred and assembled in the second stage, where the parallel batching constraint is investigated. In the two stages, the deteriorating job constraint is considered. In the proposed algorithm, first, two types of problem-specific heuristics are proposed, namely, the batch assignment and the right-shifting heuristics, which can substantially improve the makespan. Next, the encoding and decoding approaches are developed according to the problem constraints and objectives. Five types of local search operators are designed for the distributed flow shop and parallel batching stages. In addition, a novel scout bee heuristic that considers the useful information that is collected by the global and local best solutions is investigated, which can enhance searching performance. Finally, based on several well-known benchmarks and realistic industrial instances and via comprehensive computational comparison and statistical analysis, the highly effective performance of the proposed algorithm is favorably compared against several algorithms in terms of both solution quality and population diversity.

Hybrid Artificial Bee Colony Algorithm for a Parallel Batching Distributed Flow-Shop Problem With Deteriorating Jobs

We propose in this paper an effective heuristic algorithm to solve a scheduling problem that comes from industry. The workshop is an hybrid flow shop with recirculation and the problem is to perform jobs between a release date and a due date, in order to minimize the weighted number of tardy jobs. Firstly, an integer linear programming formulation of the problem is proposed, then a lower bound, a greedy algorithm and a genetic algorithm are described as approximate methods. To evaluate these heuristics, experiences on instances like industrial ones are computed, and show the efficiency of the genetic algorithm.

A genetic algorithm for an industrial multiprocessor flow-shop scheduling problem with recirculation

The history of colour is fascinating from a social and artistic viewpoint because it shows the way; use; and importance acquired. The use of colours date back to the Stone Age (the first news of cave paintings); colour has contributed to the social and symbolic development of civilizations. Colour has been associated with hierarchy; power and leadership in some of them. The advent of synthetic dyes has revolutionized the colour industry; and due to their low cost; their use has spread to different industrial sectors. Although the percentage of coloured wastewater discharged by the textile; food; pharmaceutical; cosmetic; and paper industries; among other productive areas; are unknown; the toxic effect and ecological implications of this discharged into water bodies are harmful. This review briefly shows the social and artistic history surrounding the discovery and use of natural and synthetic dyes. We summarise the environmental impact caused by the discharge of untreated or poorly treated coloured wastewater to water bodies; which has led to physical; chemical and biological treatments to reduce the colour units so as important physicochemical parameters. We also focus on laccase utility (EC 1.10.3.2), for discolouration enzymatic treatment of coloured wastewater, before its discharge into water bodies. Laccases (p-diphenol: oxidoreductase dioxide) are multicopper oxidoreductase enzymes widely distributed in plants, insects, bacteria, and fungi. Fungal laccases have employed for wastewater colour removal due to their high redox potential. This review includes an analysis of the stability of laccases, the factors that influence production at high scales to achieve discolouration of high volumes of contaminated wastewater, the biotechnological impact of laccases, and the degradation routes that some dyes may follow when using the laccase for colour removal

https://www.mdpi.com/1420-3049/26/13/3813/pdf

A Brief History of Colour, the Environmental Impact of Synthetic Dyes and Removal by Using Laccases

A biased-randomized simheuristic for the distributed assembly permutation flowshop problem with stochastic processing times

/pdf/flow-shop-scheduling-problem-under-uncertainties-review-and-4pzy5duwxi.pdf

Flow-shop scheduling problem under uncertainties: Review and trends

A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem

Stochastic flexible flow shop scheduling problem under quantitative and qualitative decision criteria

Article history: Received June 5 2015 Received in Revised Format June 29 2015 Accepted June 29 2015 Available online June 3

/pdf/grasp-to-minimize-total-weighted-tardiness-in-a-permutation-3c3zlbo7xb.pdf

Eliana María González-Neira

Papers

A biased-randomized simheuristic for the distributed assembly permutation flowshop problem with stochastic processing times

Flow-shop scheduling problem under uncertainties: Review and trends

A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem

Stochastic flexible flow shop scheduling problem under quantitative and qualitative decision criteria

GRASP to minimize total weighted tardiness in a permutation flow shop environment