Flexible Job Shop Problem (FJSP) is an extension of classical Job Shop Problem (JSP). The FJSP extends the routing flexibility of the JSP, i.e assigning machine to an operation. Thus it makes it more difficult than the JSP. In this study, Cooperative Coevolutionary Genetic Algorithm (CCGA) is presented to solve the FJSP. Makespan (time needed to complete all jobs) is used as the performance eva...

This report describes a database model currently under development at the Manufacturing System Integration Division (MSID) of the National Institute of Standards and Technology (NIST). The database model contains a set of tables that are mapped onto the machine shop information model developed by MSID. The information model provides neutral data interfaces for integrating machine shop software ...

A two level branch and bound algorithm is developed to solve an altered form of the standard flow-shop scheduling problem modeled as a bilevel programming problem. The flow-shop scheduling problem considered here differs from the standard problem in that operators are assigned to the machines and each operator has a different time table for the jobs on each machine. The shop owner is considered...

This paper provides an application oriented analysis of local search procedures for Operation Scheduling and Shop Floor Management of a major German manufacturer of cigarette machines. The heuristics applied are the Thresholdand Simulated Annealing-Algorithm considering Job Shop as well as embedded FMS production features. In this context a new neighbourhood search technique is developed, which...

Job shop scheduling problems occurs in automobile industry, aerospace industry, printing industry, and chemical industry. Job shop scheduling problems are real world and complex. The present work assesses the effect of change in setup times levels on make span, maximum flow time and maximum tardiness measures. The model of the job shop is developed in PROMODEL simulation software. Three levels ...

Sunday shop opening is deregulated to the municipal level in the Netherlands. Despite positive effects on economic growth and employment, many municipalities restrict Sunday shop opening. Based on 2003 data we show that diverse local characteristics, like the size of municipalities and religious and political affiliation, play a major role in decisions about Sunday shop opening. The evidence is...

We implement a simple two-shop search model in the laboratory with the aim to investigate if consumers behave differently in equivalent situations, where prices are displayed either as net prices or as gross prices with discounts . We compare treatments, where we either depict the known price of the first shop or the initially uncertain price of the second shop as a gross price with a discount,...

Using data from the 2013 American Community Survey, we found that 24.3 million people (about 1 in 4) who were either eligible for Medicaid/Children's Health Insurance Program (CHIP) or appeared likely to shop for Qualified Health Plan (QHP) lacked residential high-speed Internet. Specifically, 28.6% or 18.9 million people eligible for Medicaid/CHIP and 17.1% or 5.5 million people who appeared l...

This paper studies the problem of scheduling Job shops in robotic cells with no intermediate buffers, called No Wait Blocking Transport Job Shop Scheduling Problem (NWBT JSSP). This problem is an extension of the classical job shop problem. No Wait Blocking Transport job shop problems arise in many realistic production environments. To tackle this problem, we developed a Mixed Integer Linear Pr...

Flexible job shop schedule is very important in both fields of combinatorial optimization and production management. In this paper, a simulationmodel is presented to solve themulti-objective flexible job shop scheduling problem. The proposed model has been coded by Matlab which is a special mathematical computation language. After modeling the pending problem, the model is validated by five rep...