Czesław Smutnicki

Available identifiers

zbMath Open smutnicki.czeslawMaRDI QIDQ689949

List of research outcomes

Publication	Date of Publication	Type
Cyclic flow-shop scheduling with no-wait constraints and missing operations	2022-05-20	Paper
Discrete optimization in the industrial computer science	2022-01-26	Paper
Open shop cyclic scheduling	2018-05-22	Paper
Very Fast Non-dominated Sorting	2016-10-13	Paper
Scheduling with High Variety of Customized Compound Products	2011-06-28	Paper
An advanced tabu search algorithm for the job shop problem	2007-12-20	Paper
https://portal.mardi4nfdi.de/entity/Q3416604	2007-01-22	Paper
Computational Science - ICCS 2004	2005-12-23	Paper
Some aspects of scatter search in the flow-shop problem	2005-10-26	Paper
https://portal.mardi4nfdi.de/entity/Q5692629	2005-09-28	Paper
https://portal.mardi4nfdi.de/entity/Q4433455	2003-12-15	Paper
https://portal.mardi4nfdi.de/entity/Q4433459	2003-11-02	Paper
The flow shop with parallel machines: A tabu search approach	2002-08-18	Paper
https://portal.mardi4nfdi.de/entity/Q4495182	2001-10-21	Paper
https://portal.mardi4nfdi.de/entity/Q4518459	2000-11-29	Paper
An approximation algorithm for a single-machine scheduling problem with release times and delivery times	2000-08-14	Paper
Some results of the worst-case analysis for flow shop scheduling	1999-08-02	Paper
A two-machine permutation flow shop scheduling problem with buffers	1999-04-29	Paper
https://portal.mardi4nfdi.de/entity/Q4233361	1999-03-16	Paper
https://portal.mardi4nfdi.de/entity/Q4233365	1999-03-16	Paper
A fast tabu search algorithm for the permutation flow-shop problem	1999-02-22	Paper
A Fast Taboo Search Algorithm for the Job Shop Problem	1997-11-12	Paper
New results in the worst-case analysis for flow-shop scheduling	1996-10-08	Paper
A decision support system for the resource constrained project scheduling problem	1995-02-09	Paper
A note on worst-case analysis of approximation algorithms for a scheduling problem	1995-01-19	Paper
https://portal.mardi4nfdi.de/entity/Q4035090	1993-05-18	Paper
Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling	1992-06-28	Paper
Worst-case analysis of an approximation algorithm for flow-shop scheduling	1989-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3478253	1989-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3475120	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3815118	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3815846	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3824095	1988-01-01	Paper
On lower bounds on the minimum maximum lateness on one machine subject to release date	1987-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3748048	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3806977	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3807868	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3347608	1984-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3347609	1984-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3682223	1984-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3323686	1983-01-01	Paper
On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness	1983-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3947437	1980-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Czesław Smutnicki