Batch sizing and job sequencing on a single machine

Coffman, E. G.; Yannakakis, Mihalis; Magazine, Michael J.; Santos, Cipriano

doi:10.1007/bf02248589

Cited by 128 publications

(51 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Usually, the machine operates continuously until a new setup is required for manufacturing a different product. Therefore, the operation of a single-machine is dictated by the sequence in which products pass by the machine, and the formation of product batches for scheduling setup operations (Coffman et al, 1990).…”

Section: Appendix a The Manufacturing Environmentsmentioning

confidence: 99%

Reducing myopic behavior in FMS control: A semi-heterarchical simulation–optimization approach

Rey

Bonte

Prabhu

et al. 2014

Simulation Modelling Practice and Theory

View full text Add to dashboard Cite

Section: Appendix a The Manufacturing Environmentsmentioning

confidence: 99%

Reducing myopic behavior in FMS control: A semi-heterarchical simulation–optimization approach

Rey

Bonte

Prabhu

et al. 2014

Simulation Modelling Practice and Theory

View full text Add to dashboard Cite

“…Task resizing has become an interesting focus for research in recent years [7][8][9]. Maghraoui et al [10] used special constructs in the user job files to indicate the atomic computational units of the jobs.…”

Section: Related Workmentioning

confidence: 99%

“…The steps (3,4,14,(6)(7)(8)(9)(10) are repeated until all the remaining BoT TOTAL tasks are successfully deployed and processed.…”

Section: Phase Ii: Task Deployment Analysis Till Batch Task Deploymentmentioning

confidence: 99%

Batch Resizing Policies and Techniques for Fine-Grain Grid Tasks: The Nuts and Bolts

Muthuvelu¹,

Chai²,

Eswaran³

et al. 2011

Journal of Information Processing Systems

View full text Add to dashboard Cite

Abstract-The overhead of processing fine-grain tasks on a grid induces the need for batch processing or task group deployment in order to minimise overall application turnaround time. When deciding the granularity of a batch, the processing requirements of each task should be considered as well as the utilisation constraints of the interconnecting network and the designated resources. However, the dynamic nature of a grid requires the batch size to be adaptable to the latest grid status. In this paper, we describe the policies and the specific techniques involved in the batch resizing process. We explain the nuts and bolts of these techniques in order to maximise the resulting benefits of batch processing. We conduct experiments to determine the nature of the policies and techniques in response to a real grid environment. The techniques are further investigated to highlight the important parameters for obtaining the appropriate task granularity for a grid resource.

show abstract

“…Ahmadi et al (1992) considered a batch scheduling problem in a two-machine flowshop, where the processing time of a batch is constant regardless of the number and type of jobs it contains. The batching model considered in this study was previously studied by Albers and Brucker (1993), Coffman et al (1990) and Santos and Magazine, (1985). In this model the jobs assigned in the same batch require a common setup and their processing is continuous on the machine.…”

Section: Introductionmentioning

confidence: 99%

Scheduling in an assembly-type production chain with batch transfer

Lin

Cheng

Chou

2007

Omega

View full text Add to dashboard Cite

This paper addresses a three-machine assembly-type flowshop scheduling problem, which frequently arises from manufacturing process management as well as from supply chain management. Machines one and two are arranged in parallel for producing component parts individually, and machine three is an assembly line arranged as the second-stage of a flowshop for processing the component parts in batches. Whenever a batch is formed on the second-stage machine, a constant setup time is required. The objective is to minimize the makespan. In this study we establish the strong NP-hardness of the problem for the case where all the jobs have the same processing time on the second-stage machine. We then explore a useful property, based upon which a special case can be optimally solved in polynomial time. We also study several heuristic algorithms to generate quality approximate solutions for the general problem. Computational experiments are conducted to evaluate the effectiveness of the algorithms.

show abstract

Batch sizing and job sequencing on a single machine

Cited by 128 publications

References 6 publications

Reducing myopic behavior in FMS control: A semi-heterarchical simulation–optimization approach

Reducing myopic behavior in FMS control: A semi-heterarchical simulation–optimization approach

Batch Resizing Policies and Techniques for Fine-Grain Grid Tasks: The Nuts and Bolts

Scheduling in an assembly-type production chain with batch transfer

Contact Info

Product

Resources

About