Surya Liman

Surya Liman
Sampoerna University | sampoerna · Department of Industrial Engineering

Doctor of Philosophy
Dean, Faculty of Engineering and Technology

About

18
Publications
528
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
780
Citations

Publications

Publications (18)
Article
We consider the problem of determining the production lot sizes and their schedules so that the sum of setup cost, holding cost, and tardy cost is minimized. There are n orders waiting to be processed. Each order has its own due date, earliness penalty and tardiness penalty. The production is done in lots, which is the manufacturing of the same pro...
Presentation
Full-text available
The authors present a service level inventory policy for automated drug dispensing machines. Through simulation, it is shown that there could be a significant reduction in pharmaceutical shortages for a case study hospital. A pilot study was also performed to validate the simulation results. The model performed well compared to theoretical predicti...
Conference Paper
Full-text available
This paper proposes a quantitative reverse logistics system model and an application example on electronic products. An interactive heuristics algorithm is presented to solve the multi-objective optimization problems of the proposed reverse logistics system model. Reverse logistics systems no longer are confined to one-way product flows from manufa...
Article
We consider the problem of determining the production lot sizes and their schedules so that the sum of earliness and tardiness penalties is minimized. There are n orders waiting to be processed. Each order has its own due date, earliness penalty and tardiness penalty. The production is done in lots, which is the manufacturing of the same product co...
Article
We consider a static, single operation, non-pre-emptive, deterministic scheduling problem in which a set of n jobs is to be processed on k identical machines. Jobs assigned to each machine have a common due date. The number of machines (k) is unknown. Activating a machine will require additional costs to be incurred. The objective is to find an opt...
Article
We consider a static, single operation, non-pre-emptive, deterministic scheduling problem in which a set of n jobs is to be processed on k identical machines. Jobs assigned to each machine have a common due date. The number of machines (k) is unknown. Activating a machine will require additional costs to be incurred. The objective is to find an opt...
Article
We consider a single machine static and deterministic scheduling problem in which jobs have a common due window. Jobs completed within the window incur no penalties, other jobs incur either earliness or tardiness penalties. The objective is to find the optimal size and location of the window as well as an optimal sequence to minimise a cost functio...
Article
A static deterministic single machine scheduling problem with a common due window is considered. Job processing times are controllable to the extent that they can be reduced, up to a certain limit, at a cost proportional to the reduction. The window location and size, along with the associated job schedule that minimizes a certain cost function, ar...
Article
NP-hard cases of the single-item capacitated lot-sizing problem have been the topic of extensive research and continue to receive considerable attention. However, surprisingly few theoretical results have been published on approximation methods for these problems. To the best of our knowledge, until now no polynomial approximation method is known w...
Article
This paper deals with the scheduling of n jobs on a single machine to minimize the sum of weighted earliness and weighted number of tardy jobs given a delivery window. Penalties are not incurred if jobs are completed within the delivery window. The length of this delivery window (which corresponds to the time period within which the customer is wil...
Article
A simple heuristic for the n-job, one-machine nonpreemptive scheduling problem of minimizing the sum of absolute deviations of job completion times about a common due date is proposed. The heuristic, which has a complexity of O(nlogn), is shown to have a tight relative worst case error bound of 0.5. A practical and systematic guideline for determin...
Article
This paper proposes a two-stage practical product batching and batch sequencing algorithm for NC punch presses used in the production of precision sheet metal electronics components. The first stage of the algorithm batches a given set of products in order to maximize the number of products in a batch as well as the tool magazine utilization. In th...
Article
In this paper we study the n-job two-parallel machines scheduling problem with the objective of minimizing the sum of job completion times. However, instead of allowing both machines to be continuously available as is often assumed in the literature, we will only allow one of the machines to be available for a specified period of time after which i...
Article
In this paper, we investigate a single machine scheduling problem of minimizing the sum of job flow times subject to scheduled maintenance. We first provide an NP-completeness proof for the problem. This proof is much shorter than the one given in Adiri et al. [1]. The shortest processing time (SPT) sequence is then shown to have a worst case error...
Article
We consider the n-job, non-preemptive, single-machine scheduling problem of minimizing the weighted sum of tardy jobs and earliness-tardiness penalties about a common due date. We study the case of job-dependent penalties under a certain condition on the ratio of processing times and weights. Two instances of the problem, one when the due date is a...
Article
This paper describes an applied research project carried out for a major electronics manufacturer in Florida. The objective of the project was to develop an algorithm that would minimize the total moving time for drilling holes in printed cicuit boards. The algorithm that is developed combines a “nearest neighbor” heuristic with a clustering proced...
Article
This paper considers explicitly the inclusion of the inventory control problem into a classical replacement problem for components subject to failure. A comparison between the combined individual replacement and inventory policy and the combined group replacement and inventory policy is made. The objective function is the minimization of the averag...
Article
In this paper we propose an algorithm for the two-product single machine Economic Lot Scheduling Problem (ELSP). Past research on this problem has relied heavily on the assumption that both products are produced cyclically. In particular Boctor's algorithm provides optimal solution to the two-product problem under such assumption. We first simplify...