An IP Formulation for a Machine-Sequencing Problem to Minimize Job Deviations and Set-Ups

2019 ◽  
pp. 283-297
Author(s):  
Tommy Schultz
Keyword(s):  
Sequencing Problem

scholarly journals ON EQUIVALENT-JOB FOR JOB-BLOCK IN 2×n SEQUENCING PROBLEM WITH TRANSPORTATION-TIMES

1981 ◽  
Vol 24 (2) ◽  
pp. 136-146 ◽  
Author(s):  
Parkash Lal Maggu ◽  
Ghanshiam Das ◽  
Ravinder Kumar
Keyword(s):  
Sequencing Problem ◽  
Transportation Times

scholarly journals Tabu Search Heuristics for the Crane Sequencing Problem

2008 ◽  
Vol 3 (4) ◽  
pp. 412
Author(s):  
Alan R. McKendall ◽  
Jin Shang
Keyword(s):  
Tabu Search ◽  
Sequencing Problem ◽  
Search Heuristics

scholarly journals Efficient Secure Multiparty Computation Protocol for Sequencing Problem over Insecure Channel

2013 ◽  
Vol 2013 ◽  
pp. 1-5 ◽  
Author(s):  
Yi Sun ◽  
Qiaoyan Wen ◽  
Yudong Zhang ◽  
Hua Zhang ◽  
Zhengping Jin
Keyword(s):  
Homomorphic Encryption ◽  
Privacy Preserving ◽  
Secure Multiparty Computation ◽  
Online Auction ◽  
Multiparty Computation ◽  
Sequencing Problem ◽  
The Core ◽  
Secure Protocol ◽  
Core Issue

As a powerful tool in solving privacy preserving cooperative problems, secure multiparty computation is more and more popular in electronic bidding, anonymous voting, and online auction. Privacy preserving sequencing problem which is an essential link is regarded as the core issue in these applications. However, due to the difficulties of solving multiparty privacy preserving sequencing problem, related secure protocol is extremely rare. In order to break this deadlock, this paper first presents an efficient secure multiparty computation protocol for the general privacy-preserving sequencing problem based on symmetric homomorphic encryption. The result is of value not only in theory, but also in practice.

scholarly journals Cross-Docking Operations for Supply Chain Logistics in JIT Production and Distribution Systems

1970 ◽  
Vol 8 (1-2) ◽  
pp. 219-230
Author(s):  
Gyan Bahadur Thapa ◽  
Tanka Nath Dhamala ◽  
Shankar Raj Pant
Keyword(s):  
Supply Chain ◽  
Distribution Systems ◽  
Operation Time ◽  
Just In Time ◽  
Sequencing Problem ◽  
Supply Chain Logistics ◽  
Research Areas ◽  
Cross Docking ◽  
Production And Distribution ◽  
Multi Level

The multi-level production problem is one of the challenging research areas in supply chain management. We present brief literature review and mathematical models of multi-level just-in-time sequencing problem with a view of cross-docking approach for supply chain logistics. Describing cross-docking operations, we propose a mathematical model for the cross-docking supply chain logistics problem to minimize the operation time as truck sequencing problem. We establish a proposition as the synthesis of the production and logistics.Key Words: Just-in-time; Supply chain; Logistics; Cross-dock; Operation timeDOI: http://dx.doi.org/10.3126/jie.v8i1-2.5114Journal of the Institute of Engineering Vol. 8, No. 1&2, 2010/2011Page: 219-230Uploaded Date: 20 July, 2011

A New Procedure of Production Orders Sequencing in Mixed-Model Production Systems

2014 ◽  
Vol 1036 ◽  
pp. 864-868 ◽  
Author(s):  
Marcin Zemczak ◽  
Damian Krenczyk
Keyword(s):  
Task Scheduling ◽  
Production System ◽  
Mixed Model ◽  
Production Systems ◽  
Production Capacity ◽  
Approximate Solutions ◽  
Task Sequence ◽  
Optimal Method ◽  
Sequencing Problem ◽  
Car Sequencing

The paper presents the task scheduling issue, which main aim is to establish a proper sequence of tasks, that would maximize the utilization of companys production capacity. According to the literature sources, the presented sequencing problem, denoted as CSP (Car Sequencing Problem) belongs to the NP-hard class, as has been proven by simple reduction from Hamiltonians Path problem. Optimal method of solution has not yet been found, only approximate solutions have been offered, especially from the range of evolutionary algorithms. Regardless of specific production system, while considering reception of new tasks into the system, current review of the state of the system is required in order to decide whether and when a new order can be accepted for execution. In this paper, the problem of task scheduling is limited to the specific existing mixed-model production system. The main goal is to determine the effective method of creation of task sequence. Through the use of computational algorithms, and automatic analysis of the resulting sequence, rates of production are able to be checked in a real time, and so improvements can be proposed and implemented.

scholarly journals On the part inventory model sequencing problem: complexity and Beam Search heuristic

2010 ◽  
Vol 14 (1) ◽  
pp. 17-25 ◽  
Author(s):  
Malte Fliedner ◽  
Nils Boysen ◽  
Armin Scholl
Keyword(s):  
Inventory Model ◽  
Problem Complexity ◽  
Beam Search ◽  
Sequencing Problem ◽  
Search Heuristic ◽  
Model Sequencing
Sign in / Sign up

Export Citation Format

Share Document