An implementation of a genetic algorithm for the n/m/P/Cmax sequencing problem is presented, and two performance enhancements hybridisation with a local search algorithm, and a `string fridge` are evaluated. This implementation is then extended to allow the genetic algorithm to optimise the placement of additional processing units to enhance productivity, and to meet order deadlines. Finally, p...

This paper presents an MILP model for the permutation flowshop wherein the setup times are both separable from the job processing times and independent of a job’s position in the processing sequence. Two experiments were conducted to estimate the computer times necessary to solve problems with up to 9 machines and 15 jobs, and to then compare these solution time requirements to those required ...

The proposed hybrid stage shop scheduling (HSSS) model, inspired from a real case in the high-fashion industry, aims to fully exploit the potential of parallel resources, splitting and overlapping concurrent operations among teams of multifunctional machines and operators on the same job. The HSSS formally extends mixed shop scheduling (a combination of flowshop and open shop), which is able to...

As a new software licensing model, software-as-a-service (SaaS) is gaining tremendous popularity across the globe. In this study, we investigate the competition between a new entrant and an incumbent in a SaaS market, and derive the optimal market entry strategy for the new entrant. One interesting finding is that, when its product quality is significantly lower than that of the incumbent, the ...

The aim of this study was to compare pseudo-ECGs produced by different configurations of re-entry in a computational model. We initiated single, double and multiple re-entrant waves in a cuboid with Fitz-Hugh Nagumo excitability. We estimated one component of the pseudo-ECG, and applied linear time-frequency and nonlinear dimensional analysis. The pseudo-ECG produced by a single re-entrant wave...

There is an incumbent firm (denoted I), and N possible entrants. At each time step, an entrant faces the incumbent in a two stage game; assume that entrants are faced in reverse numerical order, and we number the stages correspondingly: thus stage 1 is the last stage, and entrant 1 is faced last. ALl players observe all actions taken by players in the past. At stage k, first the entrant decides...

A method for calibrating iodine-125 seeds in terms of exposure has been established. The standard free-air ionization chamber, used for measuring soft x rays, was chosen for the measurements. Arrays of four to six seeds were used to enhance the ionization-current-to-background-current ratio. Seeds from an array were measured individually in a re-entrant chamber. The quotient of the exposure rat...

Roots of seedlings of red clover and alfalfa growing on 10(1) Hoagland and Arnon solution agar were inoculated with various combinations of Meloidogyne incognita and Pratylenchus penetrans. Egg-laying by P. penetrans decreased as the number of nematodes, the ratio of entrant M. incognita to entrant P. penetrans, and the priority of invasion of roots by M. incognita increased. Embryogeny and hat...

Re-entrant scheduling is an important search problem with many constraints in the flow shop. In the literature, a number of approaches have been investigated from exact methods to meta-heuristics. This paper presents a genetic algorithm that encodes the problem as multi-level chromosomes to reflect the dependent relationship of the re-entrant possibility and resource consumption. The novel enco...