ManageChatDiscover
50314

THE SINGLE-MACHINE MULTI-PRODUCT PROBLEM: NEAR OPTIMAL SCHEDULING

Article

Last updated: 04 Jan 2025

OverviewSimilar Items

Subjects

-

Tags

-

Abstract

An iterative procedure is presented for determining near optimal production schedule in the single-machine multi-product lot sizing problem. The approach does not require equal lot sizes, and based on finding a feasible solution (lower bound).
Two examples from the previous literature indicated that cancelling the restriction of equal lot sizes may provide a
chance for producing better solutions.

DOI

10.21608/amme.1984.50314

Authors

First Name

HANY

Last Name

MAKROUM

MiddleName

A.

Affiliation

Lecturer, Dpt.of Production Engineering,Helwan University, Cairo,Egypt.

Email

-

City

-

Orcid

-

Volume

2

Article Issue

1st Conference on Applied Mechanical Engineering.

Related Issue

7654

Issue Date

1984-05-01

Receive Date

2019-09-29

Publish Date

1984-05-01

Page Start

135

Page End

141

Print ISSN

2636-4352

Online ISSN

2636-4360

Article File

AMME_Volume 2_Issue 1st Conference on Applied Mechanical Engineering._Pages 135….pdf

PDF . 1.5MB

Link

https://amme.journals.ekb.eg/article_50314.html

Detail API

https://amme.journals.ekb.eg/service?article_code=50314

Order

49

Type

Original Article

Type Code

831

Publication Type

Journal

Publication Title

The International Conference on Applied Mechanics and Mechanical Engineering

Publication Link

https://amme.journals.ekb.eg/

MainTitle

THE SINGLE-MACHINE MULTI-PRODUCT PROBLEM: NEAR OPTIMAL SCHEDULING

Details

Type

Article

Created At

22 Jan 2023