default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGiuseppe Paletta
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j25]Alex J. Ruiz-Torres
, Giuseppe Paletta, Belarmino Adenso-Díaz:
Hybrid two stage flowshop scheduling with secondary resources based on time buckets. Int. J. Prod. Res. 60(6): 1954-1972 (2022)
2010 – 2019
- 2019
- [j24]Johnny C. Ho, Ivar Massabò, Giuseppe Paletta, Alex J. Ruiz-Torres:
A note on posterior tight worst-case bounds for longest processing time schedules. 4OR 17(1): 97-107 (2019) - [j23]Alex J. Ruiz-Torres, José Humberto Ablanedo-Rosas, Somnath Mukhopadhyay, Giuseppe Paletta:
Scheduling workers: A multi-criteria model considering their satisfaction. Comput. Ind. Eng. 128: 747-754 (2019) - 2018
- [j22]Alex J. Ruiz-Torres, Giuseppe Paletta, Farzad Mahmoodi, José Humberto Ablanedo-Rosas:
Scheduling assemble-to-order systems with multiple cells to minimize costs and tardy deliveries. Comput. Ind. Eng. 115: 290-303 (2018) - 2017
- [j21]Alex J. Ruiz-Torres, Giuseppe Paletta, Rym M'Hallah:
Makespan minimisation with sequence-dependent machine deterioration and maintenance events. Int. J. Prod. Res. 55(2): 462-479 (2017) - 2016
- [j20]Ivar Massabò, Giuseppe Paletta, Alex J. Ruiz-Torres:
A note on longest processing time algorithms for the two uniform parallel machine makespan minimization problem. J. Sched. 19(2): 207-211 (2016) - 2015
- [j19]Abey Kuruvilla, Giuseppe Paletta:
Minimizing Makespan on Identical Parallel Machines. Int. J. Oper. Res. Inf. Syst. 6(1): 19-29 (2015) - [j18]Alex J. Ruiz-Torres, Giuseppe Paletta, Eduardo Pérez-Roman:
Maximizing the Percentage of On-Time Jobs with Sequence Dependent Deteriorating Process Times. Int. J. Oper. Res. Inf. Syst. 6(3): 1-18 (2015) - [j17]Giuseppe Paletta, Alex J. Ruiz-Torres:
Partial Solutions and MultiFit Algorithm for Multiprocessor Scheduling. J. Math. Model. Algorithms Oper. Res. 14(2): 125-143 (2015) - 2013
- [j16]Alex J. Ruiz-Torres, Giuseppe Paletta, Eduardo Pérez-Roman:
Parallel machine scheduling to minimize the makespan with sequence dependent deteriorating effects. Comput. Oper. Res. 40(8): 2051-2061 (2013) - 2012
- [j15]A. Cossari, Johnny C. Ho, Giuseppe Paletta, Alex J. Ruiz-Torres:
A new heuristic for workload balancing on identical parallel machines and a statistical perspective on the workload balancing criteria. Comput. Oper. Res. 39(7): 1382-1393 (2012) - 2011
- [j14]Claudia Archetti, Luca Bertazzi, Giuseppe Paletta, Maria Grazia Speranza:
Analysis of the maximum level policy in a production-distribution system. Comput. Oper. Res. 38(12): 1731-1746 (2011) - [j13]Giuseppe Paletta, Francesca Vocaturo:
A composite algorithm for multiprocessor scheduling. J. Heuristics 17(3): 281-301 (2011) - 2010
- [j12]Giuseppe Paletta, Francesca Vocaturo:
A Short Note on an Advance in Estimating the Worst-Case Performance Ratio of the MPS Algorithm. SIAM J. Discret. Math. 23(4): 2198-2203 (2010)
2000 – 2009
- 2007
- [j11]Giuseppe Paletta, Paolamaria Pietramala:
A New Approximation Algorithm for the Nonpreemptive Scheduling of Independent Jobs on Identical Parallel Processors. SIAM J. Discret. Math. 21(2): 313-328 (2007) - 2006
- [j10]Giuseppe Paletta:
A multiperiod single processor scheduling problem with periodic requirements. Eur. J. Oper. Res. 172(1): 258-273 (2006) - 2005
- [j9]Gianpaolo Ghiani, Roberto Musmanno, Giuseppe Paletta, Chefi Triki:
A heuristic for the periodic rural postman problem. Comput. Oper. Res. 32: 219-228 (2005) - [j8]Luca Bertazzi, Giuseppe Paletta, Maria Grazia Speranza:
Minimizing the Total Cost in an Integrated Vendor - Managed Inventory System. J. Heuristics 11(5-6): 393-419 (2005) - 2004
- [j7]Luca Bertazzi, Giuseppe Paletta, Maria Grazia Speranza:
An improved heuristic for the period traveling salesman problem. Comput. Oper. Res. 31(8): 1215-1222 (2004) - [j6]Giuseppe Paletta, Chefi Triki:
Solving the asymmetric traveling salesman problem with periodic constraints. Networks 44(1): 31-37 (2004) - 2002
- [j5]Giuseppe Paletta:
The period traveling salesman problem: a new heuristic algorithm. Comput. Oper. Res. 29(10): 1343-1352 (2002) - [j4]Luca Bertazzi, Giuseppe Paletta, Maria Grazia Speranza:
Deterministic Order-Up-To Level Policies in an Inventory Routing Problem. Transp. Sci. 36(1): 119-132 (2002)
1990 – 1999
- 1992
- [j3]Giuseppe Paletta:
A multiperiod traveling salesman problem: Heuristic algorithms. Comput. Oper. Res. 19(8): 789-795 (1992) - [j2]Manlio Gaudioso, Giuseppe Paletta:
A Heuristic for the Periodic Vehicle Routing Problem. Transp. Sci. 26(2): 86-92 (1992) - 1991
- [j1]Pasquale Legato, Giuseppe Paletta, Luigi Palopoli:
Optimization of join strategies in distributed databases. Inf. Syst. 16(4): 363-374 (1991)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-26 18:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
