Czesław Smutnicki

From MaRDI portal
Person:689949

Available identifiers

zbMath Open smutnicki.czeslawMaRDI QIDQ689949

List of research outcomes

PublicationDate of PublicationType
Cyclic flow-shop scheduling with no-wait constraints and missing operations2022-05-20Paper
Discrete optimization in the industrial computer science2022-01-26Paper
Open shop cyclic scheduling2018-05-22Paper
Very Fast Non-dominated Sorting2016-10-13Paper
Scheduling with High Variety of Customized Compound Products2011-06-28Paper
An advanced tabu search algorithm for the job shop problem2007-12-20Paper
https://portal.mardi4nfdi.de/entity/Q34166042007-01-22Paper
Computational Science - ICCS 20042005-12-23Paper
Some aspects of scatter search in the flow-shop problem2005-10-26Paper
https://portal.mardi4nfdi.de/entity/Q56926292005-09-28Paper
https://portal.mardi4nfdi.de/entity/Q44334552003-12-15Paper
https://portal.mardi4nfdi.de/entity/Q44334592003-11-02Paper
The flow shop with parallel machines: A tabu search approach2002-08-18Paper
https://portal.mardi4nfdi.de/entity/Q44951822001-10-21Paper
https://portal.mardi4nfdi.de/entity/Q45184592000-11-29Paper
An approximation algorithm for a single-machine scheduling problem with release times and delivery times2000-08-14Paper
Some results of the worst-case analysis for flow shop scheduling1999-08-02Paper
A two-machine permutation flow shop scheduling problem with buffers1999-04-29Paper
https://portal.mardi4nfdi.de/entity/Q42333611999-03-16Paper
https://portal.mardi4nfdi.de/entity/Q42333651999-03-16Paper
A fast tabu search algorithm for the permutation flow-shop problem1999-02-22Paper
A Fast Taboo Search Algorithm for the Job Shop Problem1997-11-12Paper
New results in the worst-case analysis for flow-shop scheduling1996-10-08Paper
A decision support system for the resource constrained project scheduling problem1995-02-09Paper
A note on worst-case analysis of approximation algorithms for a scheduling problem1995-01-19Paper
https://portal.mardi4nfdi.de/entity/Q40350901993-05-18Paper
Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling1992-06-28Paper
Worst-case analysis of an approximation algorithm for flow-shop scheduling1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34782531989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34751201988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38151181988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38158461988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38240951988-01-01Paper
On lower bounds on the minimum maximum lateness on one machine subject to release date1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37480481986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38069771986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38078681986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33476081984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33476091984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36822231984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33236861983-01-01Paper
On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39474371980-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Czesław Smutnicki