A sequential heuristic procedure for one-dimensional cutting

E-resources

Peer reviewed

A sequential heuristic procedure for one-dimensional cutting

Gradišar, Miro; Kljajić, Miroljub; Resinovič, Gortan; Jesenko, Jože

European journal of operational research, 05/1999, Volume: 114, Issue: 3

Journal Article

The article examines the Sequential Heuristic Procedure (SHP) for optimising one-dimensional stock cutting when all stock lengths are different. In order to solve a bicriterial multidimensional knapsack problem with side constraints a lexicographic approach is applied. An item-oriented solution was found through a combination of approximations and heuristics that minimize the influence of ending conditions leading to almost optimal solutions. The computer program CUT was developed, based on the proposed algorithm. Two sample problems are presented and solved. A statistical analysis of parameters that affect material utilisation was also made.

Keep searching

Author

Gradišar, Miro | Kljajić, Miroljub | Resinovič, Gortan | Jesenko, Jože

Access to the JCR database is permitted only to users from Slovenia. Your current IP address is not on the list of IP addresses with access permission, and authentication with the relevant AAI accout is required.

Year	Impact factor		Edition		Category		Classification
Year	JCR	SNIP	JCR	SNIP	JCR	SNIP	JCR	SNIP

Links to authors' personal bibliographies	Links to information on researchers in the SICRIS system

Source: Personal bibliographies and: SICRIS

Upload image

Shelf entry

Adding material to shelf was successful.

Adding material to shelf failed.

It was not necessary to add the material to the shelf.

Permalink

E-mail

Impact factor

Select the library membership card:

DRS, in which the journal is indexed

Citations

Theme