Robust parallel-batching scheduling with fuzzy deteriorating processing time and variable delivery time in smart manufacturing

The “people’s innovation” can promote development in enterprises in urgent need of innovative product design. Collaborative product design can be a powerful tool for enterprises wishing to improve their market competitiveness and customer satisfaction. To reduce decision costs, improve efficiency, and solve other issues, promoting “people’s innovation” can play a vital role. With this focus, this paper examines products produced through “people’s innovation.” A collaborative design task scheduling problem is presented. The design tasks are sorted based on a minimum delivery cost principle, which is determined using weighted shortest processing time (WSPT) rules and the shortest delivery time. The results show that distributed collaborative innovation can result in a reasonable arrangement for collaborative design tasks.

Download Full-text

BATCHING MACHINE SCHEDULING WITH BICRITERIA: MAXIMUM COST AND MAKESPAN

Asia Pacific Journal of Operational Research ◽

10.1142/s0217595914500250 ◽

2014 ◽

Vol 31 (04) ◽

pp. 1450025 ◽

Cited By ~ 2

Author(s):

CHENG HE ◽

HAO LIN ◽

JINJIANG YUAN ◽

YUNDONG MU

Keyword(s):

Processing Time ◽

Polynomial Time Algorithm ◽

Time Algorithm ◽

Pareto Optimal ◽

Pareto Optimal Solutions ◽

Optimal Solutions ◽

Maximum Cost ◽

Parallel Batching ◽

Multicriteria Problem ◽

Batching Machine

In this paper, the problem of minimizing maximum cost and makespan simultaneously on an unbounded parallel-batching machine is considered. An unbounded parallel-batching machine is a machine that can handle any number of jobs in a batch and the processing time of a batch is the largest processing time of jobs in the batch. The main goal of a multicriteria problem is to find Pareto optimal solutions. We present a polynomial-time algorithm to produce all Pareto optimal solutions of this bicriteria scheduling problem.

Download Full-text

Scheduling and Common Due Date Assignment on a Single Parallel-Batching Machine with Batch Delivery

Discrete Dynamics in Nature and Society ◽

10.1155/2015/464390 ◽

2015 ◽

Vol 2015 ◽

pp. 1-7 ◽

Cited By ~ 3

Author(s):

Hua Gong ◽

Biao Zhang ◽

Wuliang Peng

Keyword(s):

Processing Time ◽

Due Date ◽

Due Date Assignment ◽

Common Due Date ◽

Parallel Batching ◽

Batch Delivery ◽

Delivery Date ◽

Special Cases ◽

Batching Machine ◽

Production Part

We consider a single parallel-batching machine scheduling problem with delivery involving both batching scheduling and common due date assignment. The orders are first processed on the single parallel-batching machine and then delivered in batches to the customers. The batching machine can process several orders at the same time. The processing time of a production batch on the machine is equal to the longest processing time of the orders assigned into this batch. A common due date for all the orders in the same delivery batch and a delivery date for each order need to be determined in order to minimize total weighted flow time. We first prove that this problem is NP hard in the strong sense. Two optimal algorithms by using dynamic programming are derived for the two special cases with a given sequence of orders on the machine and a given batching in the production part, respectively.

Download Full-text

Determination of Order Delivery Time in Event Organizer Industry Using a Non-Delay Scheduling Approach

International Journal of Service Management and Sustainability ◽

10.24191/ijsms.v5i1.9868 ◽

2020 ◽

Vol 5 (1) ◽

pp. 1

Author(s):

Nur Indrianti ◽

Vina Islamia Vervly Suandevin

Keyword(s):

Production Process ◽

Processing Time ◽

Manufacturing Industry ◽

Job Shop ◽

Service Industries ◽

Delivery Time ◽

Priority Rules ◽

Balanced Distribution ◽

Spt Rule

This study discusses the determination of order delivery time in the event organizer (EO) industry. With regard to the characteristics of the EO production process that is identical to the job shop production process in the manufacturing industry, a non-delay scheduling approach is applied. The non-delay schedule is compiled using the non-delay algorithm with the criteria for makespan minimization. Job assignment is done using the shortest processing time (SPT), longest processing time (LPT), and first comes first served (FCFS) priority rules. We consider the situation where all orders arrive simultaneously (offline) and at different time (online). As a case study, the modified non-delay algorithm is examined to solve the problem of an EO in Indonesia. The results of the study show that the nondelay algorithm using SPT rule provides the best schedule performance which results in the shortest makespan and the lowest resource idle time. In addition to determining the delivery time, the resulting non-delay schedule can be used to control the execution of each order. The method of determining order delivery time in this study can be applied to other service industries. Further study can be developed for situations where order arrival and processing time are probabilistic. Furthermore, it is also necessary to consider the balanced distribution of the workload among operators. Determination of Order Delivery Time in Event

Download Full-text

COMMIT TIME DECISION FOR MEASURING DEMAND SIDE QUALITY COSTS WITH LIMITED DISTRIBUTION INFORMATION

International Journal of Information Technology & Decision Making ◽

10.1142/s021962200400115x ◽

2004 ◽

Vol 03 (03) ◽

pp. 435-452 ◽

Cited By ~ 1

Author(s):

JINFENG YUE ◽

MIN-CHIANG WANG ◽

ZHIMIN HUANG

Keyword(s):

Processing Time ◽

Maximum Amount ◽

Time Range ◽

Demand Side ◽

Delivery Time ◽

Numerical Examples ◽

Additional Information ◽

Quality Costs ◽

The Mean ◽

Machine Processing

Consider a single machine processing multiproducts situation when only the mean and standard deviation of processing time for each product are available. The bounds of optimal commit delivery time range are obtained. A decision of the robust commit delivery time is suggested. An extension to the situation with information of orders in queue is also discussed. Numerical examples show that the suggested decision performs well. The expected value of additional information, which measures the maximum amount a decision maker is willing to pay for knowledge of true distribution information, is small, and that further demonstrates the worthiness of the suggested robust decision.

Download Full-text

A new tool for rapid development of electron microscopy negatives and micrographs: Initial impressions of the MOHR/PRO-8 processor

Proceedings, annual meeting, Electron Microscopy Society of America ◽

10.1017/s0424820100129498 ◽

1992 ◽

Vol 50 (2) ◽

pp. 972-973

Author(s):

James C. Long

Keyword(s):

Electron Microscopy ◽

Processing Time ◽

Rapid Development ◽

Processing Times ◽

Initial Impressions ◽

Transport Method

Over the years, many techniques and products have been developed to reduce the amount of time spent in a darkroom processing electron microscopy negatives and micrographs. One of the latest tools, effective in this effort, is the Mohr/Pro-8 film and rc paper processor.At the time of writing, a unit has been recently installed in the photographic facilities of the Electron Microscopy Center at Texas A&M University. It is being evaluated for use with TEM sheet film, SEM sheet film, 35mm roll film (B&W), and rc paper.Originally designed for use in the phototypesetting industry, this processor has only recently been introduced to the field of electron microscopy.The unit is a tabletop model, approximately 1.5 × 1.5 × 2.0 ft, and uses a roller transport method of processing. It has an adjustable processing time of 2 to 6.5 minutes, dry-to-dry. The installed unit has an extended processing switch, enabling processing times of 8 to 14 minutes to be selected.

Download Full-text

How Much Processing Time Is Needed to Drive Perceptual Recalibration of Speech?

PsycEXTRA Dataset ◽

10.1037/e528942014-166 ◽

2014 ◽

Author(s):

Arthur Samuel

Keyword(s):

Processing Time

Download Full-text

Penjadwalan Produksi Menggunakan Metode Simulated Annealing pada Unit Produksi Daun Pintu di PT. ML

Talenta Conference Series Energy and Engineering (EE) ◽

10.32734/ee.v2i2.445 ◽

2019 ◽

Vol 2 (2) ◽

Author(s):

Rosnani Ginting ◽

Chairul Rahmadsyah Manik

Keyword(s):

Simulated Annealing ◽

Problem Solving ◽

Production Scheduling ◽

Production Control ◽

Delivery Time ◽

Production Schedule ◽

A Company ◽

Predetermined Time ◽

Factory Floor

Penjadwalan merupakan aspek yang sangat penting karena didalamnya terdapat elemen perencanaan dan pengendalian produksi bagi suatu perusahaan yang dapat mengirim barang sesuai dengan waktu yang telah ditentukan, untuk memperoleh waktu total penyelesaian yang minimum. Masalah utama yang dihadapi oleh PT. ML adalah keterlambatan penyelesaian order yang mempengaruhi delivery time ke tangan costumer karena pelaksanaan penjadwalan produksi dilantai pabrik belum menghasilkan makespan yang sesuai dengan order yang ada. Oleh kaena itu dituntut untuk mencari solusi pemecahan masalah optimal dalam penentuan jadwal produksi untuk meminimisasi total waktu penyelessaian (makespan) semua order. Dalam penelitian ini, penjadwalan menggunakan metode Simulated Annealing (SA) diharapkan dapat menghasilkan waktu total penyelesaian lebih cepat dari penjadwalan yang ada pada perusahaan. Scheduling is a very important aspect because in it there are elements of planning and production control for a company that can send goods in accordance with a predetermined time, to obtain a minimum total time of completion. The main problem faced by PT. ML is the delay in completing orders that affect delivery time to customer because the implementation of production scheduling on the factory floor has not produced the makespan that matches the existing order. Therefore, it is required to find optimal problem solving solutions in determining the production schedule to minimize the total time of elimination (makespan) of all orders. In this study, scheduling using the Simulated Annealing (SA) method is expected to produce a total time of completion faster than the existing scheduling in the company.

Download Full-text

Classifying the Past: Discriminant Analysis and its Application to Medieval Farming Systems

History and Computing ◽

10.3366/hac.1996.8.1.1 ◽

1996 ◽

Vol 8 (1) ◽

pp. 1-10 ◽

Cited By ~ 2

Author(s):

Ken Bartley

Keyword(s):

Cluster Analysis ◽

Discriminant Analysis ◽

Processing Time ◽

Farming Systems ◽

Frame Of Reference ◽

Analytical Models ◽

Successful Implementation ◽

Medieval Period ◽

The Past ◽

Livestock Management

This paper discusses the need for nationally based analytical models of the medieval period. The use of cluster analysis as a method for classifying demesne farms, by the crops they grew and their livestock management, is explained. Successful implementation of cluster analysis requires both the existence of a large base sample, to permit isolation of specific groupings within the data, and access to considerable processing time. The paper concludes by demonstrating how discriminant analysis can provide an efficient and systematic way of classifying even a single manor within a national frame of reference.

Download Full-text