نتایج جستجو برای: shop

تعداد نتایج: 11410  

2002
Wolfram Conen

We discuss the application of economic coordination mechanisms to scheduling problems in manufacturing and logistics. We use job shop scheduling as a sample problem domain. We study economically augmented job shop problems (EJSP) which comprise valuation information. We demonstrate how instances of EJSP can be mapped to combinatorial job shop auction problems (CJSAP). A discussion of the tracta...

2007
T. Ramayah Joshua Ignatius

This paper explores the relationship between the three beliefs about online shopping ie. perceived usefulness, perceived ease of use and perceived enjoyment and intention to shop online. A sample of 150 respondents was selected using a purposive sampling method whereby the respondents have to be Internet users to be included in the survey. A structured, self-administered questionnaire was used ...

2011
D. Y. Sha Hsing-Hung Lin

Multi-objective open-shop scheduling is definitely significant in practical. However, the research focused on multi-objective open-shop scheduling was relatively scarce. This article proposed a particle swarm optimization to address open-shop scheduling problems with multiple objectives. Originally, particle swarm optimization was invented to treat continuous optimization problems. In this pape...

2009
Mahmoud Masoud Erhan Kozan Geoff Kent

In Australia, railway systems play a vital role in transporting the sugarcane crop from farms to mills. In this paper, a novel job shop approach is proposed to create a more efficient integrated harvesting and sugarcane transport scheduling system to reduce the cost of sugarcane transport. There are several benefits that can be attained by treating the train scheduling problem as a job shop pro...

2000
Marko Snoek

In this paper a new neuro-genetic architecture is presented that solves a profit oriented dynamic job shop problem. In the job shop order acceptance and scheduling problem new jobs arrive continuously and because of insufficient job shop capacity, a selection has to be made among the offered jobs. The goal is to find an order acceptance policy, which is supported by a scheduling policy, that ma...

Journal: :IJISSCM 2008
Mark Eklin Yohanan Arzi Avraham Shtub

This article presents a deterministic model for rough-cut cost estimation in a capacitated madeto-order environment. We assume that a firm can execute each job either at its own shop or by outsourcing it. The model calculates the unit cost of each product while taking into account the shop floor rough-cut capacity planning, and by determining what to produce in the firm’s shop and what to outso...

2013
Yuri N. Sotskov Omid Gholami Frank Werner

A learning stage of scheduling tends to produce knowledge about a benchmark of priority dispatching rules which allows a scheduler to improve the solution quality for a set of similar job-shop problems. Once trained on the sample job-shop problems (usually with small sizes), the adaptive algorithm solves a similar job-shop problem (with a moderate size or a large size) better than heuristics us...

Journal: :IJCSE 2012
Maria do Rosário Alves Moreira Rui Alberto F. S. Alves

This paper presents and evaluates an order release decision rule in a job-shop, based on the input-output control concept. The order release mechanism is part of a global decision-making scheme that includes four main decisions: accept/reject orders, define the order’s due date, release the accepted jobs and dispatch it on the shop floor. This paper also presents an evaluation of two acceptance...

2001
Liao Qiang Tham Chen Khong Chris Choy

The paper presents an enterprise application that integrates material requirement planning (MRP) with job shop simulator using distributed object technology. The application aims to realize an integrated system that has rapid response to changing requirements and capability to integrate heterogeneous manufacturing facilities. At first, the application accepts the customer’s order and performs m...

2008
Frédéric Dugardin Hicham Chehade Lionel Amodeo Farouk Yalaoui Christian Prins

Scheduling is a scientific domain concerning the allocation of limited tasks over time. The goal of scheduling is to maximize (or minimize) different criteria of a facility as makespan, occupation rate of a machine, total tardiness ... In this area, scientific community usually group the problem with, on one hand the system studied, defining the number of machines (one machine, parallel machine...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید