Interoperability between manufacturing software applications and simulation is currently extremely limited. A machine shop information model has been developed at the National Institute of Standards and Technology (NIST) as a part of system interoperability efforts. The primary objective is to develop a standard-data-interface structure for exchanging shop data among various manufacturing softw...

A women's health shop in Edinburgh was open for 16 months to provide information and advice in a non-clinical setting and to allow an interchange between informal and formal care in the community. Staffed by nurses, it was visited by 5664 women and 400 men, an average of 24 people each working day. The most popular topics for discussion were women's health problems, and 17% of women had a perso...

Genetic algorithms are a very popular heuristic which have been successfully applied to many optimization problems within the last 30 years. In this chapter, we give a survey on some genetic algorithms for shop scheduling problems. In a shop scheduling problem, a set of jobs has to be processed on a set of machines such that a specific optimization criterion is satisfied. According to the restr...

Multiprocessor open shop makes a generalization to classical by allowing parallel machines for the same task. Scheduling of this environment minimize makespan is strongly NP-Hard problem. Despite its wide application areas in industry, research field still limited. In paper, proportionate case considered where task requires fixed processing time independent job identity. A novel highly efficien...

In this paper novel hybrid genetic algorithms for Open--Shop Scheduling Problem (OSSP) are presented. Two greedy heuristics LPT-Task and LPT-Machine are proposed for decoding chromosomes represented by permutations with repetitions. For comparison the standard permutation representation of OSSP instances is used. The algorithms apply also efficient crossover operator LOX and mutation operators ...

In this paper, we consider the problem of scheduling n jobs on m machines in an open shop environment so that the sum of completion times or mean flow time becomes minimal. For this strongly NP-hard problem, we develop and discuss different constructive heuristic algorithms. Extensive computational results are presented for problems with up to 50 jobs and 50 machines, respectively. The quality ...

in this paper, a new approach to overlapping operations in job shop scheduling is presented. in many job shops, a customer demand can be met in more than one way for each job, where demand determines the quantity of each finished job ordered by a customer. in each job, embedded operations can be performed due to overlapping considerations in which each operation may be overlapped with the other...