Bi-objective scheduling on a restricted batching machine

2018 ◽  
Vol 100 ◽  
pp. 201-210 ◽  
Author(s):  
Marta Cabo ◽  
José Luis González-Velarde ◽  
Edgar Possani ◽  
Yasmín Á. Ríos Solís
Keyword(s):  
Batching Machine

Scheduling a single semi-continuous batching machine

Omega ◽  
2008 ◽  
Vol 36 (6) ◽  
pp. 992-1004 ◽  
Author(s):  
Lixin Tang ◽  
Yufang Zhao
Keyword(s):  
Batching Machine

scholarly journals A Batching Machine Model for Lot Scheduling on a Single Machine

2018 ◽  
Vol 43 (1) ◽  
pp. 37-40
Author(s):  
Mikhail Y. Kovalyov
Keyword(s):  
Single Machine ◽  
Completion Time ◽  
Optimal Solution ◽  
Time Algorithm ◽  
Machine Model ◽  
Average Completion Time ◽  
Lot Scheduling ◽  
Batching Machine ◽  
Machine Problem ◽  
Total Average

Abstract A recently introduced lot scheduling problem is considered. It is to find a partition of jobs of n orders into lots and to sequence these lots on a single machine so that the total average completion time of the orders is minimized. A simple O(n log n) time algorithm is presented for this problem in the literature, with a relatively sophisticated proof of its optimality. We show that modeling this problem as a classic batching machine problem makes its optimal solution obvious.

scholarly journals Parallel Batch Scheduling of Deteriorating Jobs with Release Dates and Rejection

2014 ◽  
Vol 2014 ◽  
pp. 1-7
Author(s):  
Juan Zou ◽  
Cuixia Miao
Keyword(s):  
Approximation Scheme ◽  
Deteriorating Jobs ◽  
Time Algorithm ◽  
Batch Scheduling ◽  
Release Dates ◽  
Ordinary Sense ◽  
Starting Time ◽  
Total Penalty ◽  
Batching Machine ◽  
Increasing Function

We consider the unbounded parallel batch scheduling with deterioration, release dates, and rejection. Each job is either accepted and processed on a single batching machine, or rejected by paying penalties. The processing time of a job is a simple linear increasing function of its starting time. The objective is to minimize the sum of the makespan of the accepted jobs and the total penalty of the rejected jobs. First, we show that the problem is NP-hard in the ordinary sense. Then, we present two pseudopolynomial time algorithms and a fully polynomial-time approximation scheme to solve this problem. Furthermore, we provide an optimalO(nlog⁡n)time algorithm for the case where jobs have identical release dates.

Two-agent scheduling on a single sequential and compatible batching machine

2017 ◽  
Vol 64 (8) ◽  
pp. 628-641 ◽  
Author(s):  
Shisheng Li ◽  
T.C.E. Cheng ◽  
C.T. Ng ◽  
Jinjiang Yuan
Keyword(s):  
Agent Scheduling ◽  
Batching Machine

Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes

2017 ◽  
Vol 258 (2) ◽  
pp. 478-490 ◽  
Author(s):  
Jun-Qiang Wang ◽  
Guo-Qiang Fan ◽  
Yingqian Zhang ◽  
Cheng-Wu Zhang ◽  
Joseph Y.-T. Leung
Keyword(s):  
Processing Time ◽  
Parallel Batching ◽  
Agent Scheduling ◽  
Batching Machine

The Design of the Small Automatic Batching Machine Control System

2011 ◽  
Vol 383-390 ◽  
pp. 2672-2676
Author(s):  
Tao Sui ◽  
Bing Li ◽  
Xiu Zhi Liu ◽  
Wen Shang Xu
Keyword(s):  
Control System ◽  
Granular Material ◽  
Automatic Control ◽  
High Precision ◽  
Manual Control ◽  
Program Scheme ◽  
The Core ◽  
Software Program ◽  
Machine Control ◽  
Batching Machine

The paper describes a small batching machine control system that takes chip C8051F040 as the core controller. The system that has automatic control and manual control modes can complete the high-precision automatic weighing of few powder and granular material. This article describes the composition of the control system and the major design of hardware, and provides more detailed software program scheme.

Sign in / Sign up

Export Citation Format

Share Document